Re: help with EBNF grammar

"Barry Watson" <uabbwat@uab.ericsson.se>
4 Apr 2001 00:20:01 -0400

          From comp.compilers
Related articles
help with EBNF grammar paul.meaney@qa.comstar.co.uk (Paul Meaney) (2001-03-28)
Re: help with EBNF grammar rael@zopyra.com (William S. Lear) (2001-03-31)
Re: help with EBNF grammar rboland@unb.ca (Ralph Boland) (2001-03-31)
Re: help with EBNF grammar mahesha@india.hp.com (Mahesha N) (2001-03-31)
Re: help with EBNF grammar limpus@immortalnet.com.au (Raymond Limpus) (2001-03-31)
Re: help with EBNF grammar mike@dimmick.demon.co.uk (Mike Dimmick) (2001-03-31)
Re: help with EBNF grammar uabbwat@uab.ericsson.se (Barry Watson) (2001-04-04)
Re: help with EBNF grammar rael@zopyra.com (William S. Lear) (2001-04-04)
| List of all articles for this month |
From: "Barry Watson" <uabbwat@uab.ericsson.se>
Newsgroups: comp.compilers,comp.compilers.tools.javacc
Date: 4 Apr 2001 00:20:01 -0400
Organization: UAB/Y/SL
References: 01-03-154 01-03-166
Keywords: parse, comment
Posted-Date: 04 Apr 2001 00:20:01 EDT

Ralph Boland wrote in message
>If your grammar is simple enough then a recursive decent compiler is
>pretty easy to write. Are you comfortable with programs that are
>highly recursive?
>
>Ralph Boland


I'm just nit-picking I know but your "simple = recursive descent"
statement is just shocking to me.
[It shouldn't be. Recursive descent is LL(1) which handles a smaller
set of grammars than pretty much any other scheme you can think of other
than operator precedence. -John]

Post a followup to this message

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