|VW Grammar help req from Beginner email@example.com (2002-01-28)|
|Re: VW Grammar help req from Beginner Trevor.Jenkins@suneidesis.com (Trevor Jenkins) (2002-01-30)|
|From:||firstname.lastname@example.org (Alex Gittens)|
|Date:||28 Jan 2002 01:14:37 -0500|
|Posted-Date:||28 Jan 2002 01:14:37 EST|
I just started reading a book which claims to explain parsing
techniques in a non-mathematical manner: "Parsing Techniques: a
practical guide." So far, it has done an ok job of explaining
languages and grammars, and the different levels of grammars. But when
it started explaining how CF grammars can be used to emulate CS
grammars, I got lost. I get the general idea, but what is the *point*?
Isn't having to generate usable rules from the hyperrules just as
inefficient, if not more, as having a long list of alternatives in a
one-level CF grammar? Any help in understanding why VM grammars are
actually useful would be much appreciated by this nonmathematical
type; if you could point me to working code (any language) using VM
grammars in action, I'd be much obliged.
Return to the
Search the comp.compilers archives again.