243 views

1 Answer

0 votes
0 votes
Language of LR(1) (set of all LR(1) grammars) is same as DCFL.

Language of LR(0) ⊂Language of LR(1) = Language of LR(2) = Language of LR(k), k > 0.

So the statement 1 is true and statement 2 is false.

Related questions

2 votes
2 votes
2 answers
2
s_dr_13 asked Jan 3, 2022
491 views
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Hirak asked Jun 1, 2019
2,089 views
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.