|Types of grammars. Luke@comodo.techi.com.force9.net (Luke) (1998-08-19)|
|Re: Types of grammars. firstname.lastname@example.org (Chris F Clark) (1998-08-19)|
|Re: Types of grammars. email@example.com (Chris F Clark) (1998-08-20)|
|Re: Types of grammars. firstname.lastname@example.org (1998-08-24)|
|Re: Types of grammars. email@example.com (1999-05-20)|
|Re: Types of grammars. firstname.lastname@example.org (1999-06-02)|
|Date:||19 Aug 1998 16:20:33 -0400|
|Organization:||Comodo Technology Development|
|Keywords:||parse, theory, question|
I am using the Appel (Tiger) book to learn something about compiler design.
But I still find some things a bit confusing where grammars are concerned.
I am sure most people have the same problem.
Could somebody please tell me how all the grammars fit together? i.e. Is an
LL(k) grammar a subset of LR(k)?
Also, when building LR state diagrams, are the epsilon productions also
stmt -> .expr '+' expr
stmt -> .E
Where E == epsilon.
All help gratefully received, thanks,
Return to the
Search the comp.compilers archives again.