Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,028 of 2,753    |
|    SM Ryan to All    |
|    Re: cycle free grammar ?    |
|    07 Aug 07 20:03:31    |
      From: wyrmwif@tsoft.org              ctx2002@gmail.com wrote:       # 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.              In Aho and Ullman _The Theory of Parsing, Translation, and Compiling_,       Volume 1, they have a number of grammar transformation algorithms       including this one. I don't have a copy at hand, but it's in there.              --       SM Ryan http://www.rawbw.com/~wyrmwif/       Mention something out of a Charleton Heston movie, and suddenly       everybody's a theology scholar.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca