|Types of grammars. Luke@comodo.techi.com.force9.net (Luke) (1998-08-19)|
|Re: Types of grammars. email@example.com (Chris F Clark) (1998-08-19)|
|Re: Types of grammars. firstname.lastname@example.org (Chris F Clark) (1998-08-20)|
|Re: Types of grammars. email@example.com (1998-08-24)|
|Re: Types of grammars. firstname.lastname@example.org (1999-05-20)|
|Re: Types of grammars. email@example.com (1999-06-02)|
|Date:||20 May 1999 01:47:07 -0400|
|Keywords:||parse, LL(1), LR(1)|
On 1998-08-19 Luke@comodo.techi.com.force9.net said:
>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)?
A grammar may be LL(k) if it satisfies some condition, other condition are
needed for a grammar to be LR(k).
It turns out that a grammar that is LL(k) also satisfies the conditions to
For the languages defined by the grammars, you have that every language
defined by a grammar LL(k) may also be defined by a grammar LR(1).
Return to the
Search the comp.compilers archives again.