search
Log In
0 votes
343 views
If grammar is LL(1) then which of the following is always true?

A. It is LALR

B. It is LR (1)

C. Both A and B

Please give answer with necessary explanations as there are different answers in different sites.
in Compiler Design 343 views
1

Follow this 

0
Thanks

1 Answer

1 vote
 
Best answer
If a grammar is LL(1), then grammar is LALR(1).

If a grammar is LALR(1) then LL(1).

Option C.

selected by

Related questions

0 votes
0 answers
1
382 views
(Note:- It is not a question just a doubt related to parsers topic) Ques:- Can CLR(1) parser may contain SR and RR conflicts? (Actually, According to me it can have both RR and SR conflict but in some websites, it shows it can't have SR conflicts. I think it is ... Please help me out). My Explanation:- Suppose in one of transition state the transition is as:- Can you please tell me if I am wrong.
asked Jun 14, 2018 in Compiler Design kislaya Pant 382 views
3 votes
2 answers
2
319 views
Given answer is (D), how?
asked Jan 27, 2018 in Compiler Design Manu Thakur 319 views
0 votes
0 answers
3
114 views
The following is an ambiguous grammar for expressions with $n$ binary, infix operators, at $n$ different levels of precedence: $E\rightarrow E\theta_{1}E\mid E\theta_{2}E\mid \cdot\cdot\cdot E\theta_{n}E\mid(E)\mid id$ ... of the tables for the two (ambiguous and unambiguous) grammars compare? What does that comparison tell you about the use of ambiguous expression grammars?
asked Aug 20, 2019 in Compiler Design Lakshman Patel RJIT 114 views
0 votes
1 answer
4
212 views
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
asked Mar 26, 2019 in Compiler Design aditi19 212 views
...