| Related articles |
|---|
| RE's to CFG's clive_minnican@hotmail.com (Clive Minnican) (2000-12-18) |
| Re: RE's to CFG's cfc@world.std.com (Chris F Clark) (2000-12-19) |
| Re: RE's to CFG's philip.fortomas@virgin.net (Philip Fortomas) (2000-12-20) |
| From: | "Clive Minnican" <clive_minnican@hotmail.com> |
| Newsgroups: | comp.compilers |
| Date: | 18 Dec 2000 00:40:49 -0500 |
| Organization: | ntl Cablemodem News Service |
| Keywords: | DFA, question |
| Posted-Date: | 18 Dec 2000 00:40:49 EST |
Hi,
Does anyone know of any good internet documents explaining the process
involved in converting Regular Expressions (RE's) to Context-Free
Grammars (CFG's) by hand? Or can anyone explain it to me easily?
Clive.
[Um, unless I'm missing something, REs are a subset of CFGs, no
conversion needed other than perhaps notation. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.