Related articles |
---|
Parsing nested structures with yacc amoebae@gmail.com (amoe) (2008-08-07) |
Re: Parsing nested structures with yacc cfc@shell01.TheWorld.com (Chris F Clark) (2008-08-08) |
Re: Parsing nested structures with yacc max@gustavus.edu (Max Hailperin) (2008-08-09) |
Re: Parsing nested structures with yacc kamalpr@hp.com (kamal) (2008-08-11) |
Re: Parsing nested structures with yacc amoebae@gmail.com (amoe) (2008-08-19) |
Re: Parsing nested structures with yacc max@gustavus.edu (Max Hailperin) (2008-08-20) |
From: | amoe <amoebae@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 19 Aug 2008 08:20:13 -0700 (PDT) |
Organization: | Compilers Central |
References: | 08-08-014 |
Keywords: | parse, question |
Posted-Date: | 19 Aug 2008 22:19:44 EDT |
Thanks for the responses, everyone. I was a little worried about an
artificial limitation on the nesting-level of sexps being imposed by
the use of right recursion. Having read the docs for bison (which I'm
actually using), it looks like this won't come up in practice - and
for this project I'd rather keep it simple.
However, I'd be interested to know - can Max's solution be converted
to a left-recursive one that can manually allocate arbitrary hunks of
memory for new tokens? How much more complicated would that solution
be, and what would be the general strategy?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.