Types of grammars.

"Luke" <Luke@comodo.techi.com.force9.net>
19 Aug 1998 16:20:33 -0400

          From comp.compilers
Related articles
Types of grammars. Luke@comodo.techi.com.force9.net (Luke) (1998-08-19)
Re: Types of grammars. cfc@world.std.com (Chris F Clark) (1998-08-19)
Re: Types of grammars. cfc@world.std.com (Chris F Clark) (1998-08-20)
Re: Types of grammars. adrian@dcs.rhbnc.ac.uk (1998-08-24)
Re: Types of grammars. sergenth@tin.it (1999-05-20)
Re: Types of grammars. hunk@alpha1.csd.uwm.edu (1999-06-02)
| List of all articles for this month |
From: "Luke" <Luke@comodo.techi.com.force9.net>
Newsgroups: comp.compilers
Date: 19 Aug 1998 16:20:33 -0400
Organization: Comodo Technology Development
Keywords: parse, theory, question

Hello all,


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
included?


i.e.
        stmt -> .expr '+' expr
        stmt -> .E
Where E == epsilon.


All help gratefully received, thanks,
Luke.
--

Post a followup to this message

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