Log In
0 votes
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1).

What is the meaning of expressive power? I know that
LR(0)<SLR(1)<LALR(1)<CLR(1), what is the meaning of this?
in Compiler Design 110 views

Any grammar that can be parsed by an LR(0) parser can be parsed by an SLR(1) parser. However, SLR(1) parsers can parse a larger number of grammars than LR(0), and so on.
Makes sense? the power represents here the ability to accept grammars.

hello thank you for replying, we categorize the grammar like CFG, CSL, RG and all these. what does it mean LL(1), LR(0) grammar. Are we categorizing the grammar again? What is the bigger picture? You have said any grammar means it can be CFG, CSL anything?

At syntax analyses phase we use parsers and therefore categories them as LL(0) SLR(1) and so on

And for a  grammar - the languages they are able to recognize. We categories as CFG CSG and so on.

Please log in or register to answer this question.

Related questions

0 votes
1 answer
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
asked Jun 1, 2019 in Compiler Design Hirak 143 views
0 votes
0 answers
Let us say + and * are both left and right associative then how is expression evaluated in top down parse? E- E*E / E+E / num Does it follow left most derivation?
asked Nov 21, 2017 in Compiler Design iarnav 114 views
1 vote
0 answers
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this? According to me it is NOT LL(1) (since it is left factored), NOT LR(0) (Since the Item 0 has a R-R conflict), NOT SLR(1) (The item 0 has a RR conflict since Follow(X) = Follow(Y) = {a,b} correct me If i'm wrong
asked Nov 23, 2018 in Compiler Design Hopealways 367 views
0 votes
0 answers
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
asked Apr 4, 2018 in Compiler Design smsubham 152 views