Re: regular expression operators in CF grammars

> I've spent the last week writing a recursive descent parser, and my
> experience is a bit different from yours. For me, writing functions
> that encapsulated common patterns greatly simplified the parser and
> made it much more readable.


A disadvantage of the recursive descent technique is that a function needs
to be written for every nonterminal, whether or not it has associated
semantic actions. So, shorter grammars mean less code, which generally makes
a program easier to understand.


http://parsers.org/slk

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