cycle free grammar ?
Sat, 04 Aug 2007 17:50:12 -0700

          From comp.compilers

Related articles
cycle free grammar ? (2007-08-04)
Re: cycle free grammar ? (SM Ryan) (2007-08-07)
Re: cycle free grammar ? (Max Hailperin) (2007-08-08)
| List of all articles for this month |

Newsgroups: comp.compilers
Date: Sat, 04 Aug 2007 17:50:12 -0700
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 07 Aug 2007 09:44:45 EDT

hi all:

I am currently learning how to write a compiler , i am using a book
called Compilers Principles , techniques, and tools.

in this book , there is an exercise asking write a algorithm to
convert a grammar into a equivalent cycle - free grammar.

for example:

convert grammar s->ss|(s)|e to a cycle free grammar.

any one know how to do that?

i have searched google, have not found any thing yet.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.