|Top-Down Parser Construction Conjectures email@example.com (1993-01-18)|
|Re: Recursive descent parsing is better than LL(1) firstname.lastname@example.org (Pete Jinks) (1993-01-27)|
|Automatic Transformation of CFG to LL/LR email@example.com (1993-01-29)|
|Re: Automatic Transformation of CFG to LL/LR firstname.lastname@example.org (1993-02-02)|
|Re: Automatic Transformation of CFG to LL/LR email@example.com (1993-02-03)|
|From:||firstname.lastname@example.org (Ramki Thurimella)|
|Date:||Fri, 29 Jan 1993 18:13:15 GMT|
I remember seeing recently a posting on this newsgroup requesting
pointers to the following question: given an arbitrary context-free
grammar, does there exist a program/tool that would automatically
convert it to LL(1) or LR(1) grammar.
While testing to see if a given CFG is LL(1) or LR(1) simple and
decidable, converting one is undecidable. Exercises 5.1.12 and 5.2.12 of
Aho, A.V. and Ullman, J.D., "The Theory of Parsing, Translation,
and Compiling," Vol. 1: Parsing, Prentice-Hall, Englewood Cliffs,
raise the same issues as that of the previous posting.
Return to the
Search the comp.compilers archives again.