# LL (1) Parser Compiler Design

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

1

0
Thanks

1 vote

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

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

Option C.

selected

## Related questions

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