| Related articles |
|---|
| Problem with infinite left-recursion... cbs@ascinc.com (1994-12-12) |
| Re: Problem with infinite left-recursion... jjan@cs.rug.nl (1994-12-14) |
| Re: Problem with infinite left-recursion... tophat!mauney@uunet.uu.net (1994-12-14) |
| Re: Problem with infinite left-recursion... davidm@Rational.COM (1994-12-19) |
| Newsgroups: | comp.compilers |
| From: | cbs@ascinc.com (Casper B. Stoel) |
| Keywords: | parse, question, comment |
| Organization: | Compilers Central |
| Date: | Mon, 12 Dec 1994 15:47:36 GMT |
Hi,
I have a problem with left-recursion in my grammar. I am wondering if
there is a 'standard' way of breaking the recursion? Is there an easy
way of breaking up the rule into multiple rules?
Any suggestions or pointers are very welcome!
Casper Stoel (cbs@ascinc.com)
[You could always use a bottom-up parser and avoid the problem altogether.
The Dragon book discusses this in the context of recursive descent, -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.