Register

LL grammar and DCFL

283 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
sripo asked Nov 10, 2018
3,249 views
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
User Avatar
0 votes
0 votes
1 answer
3
Rahul Ranjan 1 asked Mar 19, 2018
4,964 views
Check if grammar is LL(1) ?
Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?
Given a grammar :$E \rightarrow E + T / T$$T \rightarrow i$Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without dra...
User Avatar
4 votes
4 votes
1 answer
4
ankitgupta.1729 asked Dec 31, 2017
6,943 views
LL(k) Grammar
Consider the grammar with the following productions. S→aaB/aaC B→b C→c Which of the following option is true ? (A) The grammar is LL(3) (B) The grammar is LL(1) (C) The grammar is LL(2) (D) It can’t be LL(k) grammar for any k, as it contains left factoring.
Consider the grammar with the following productions.S→aaB/aaCB→bC→cWhich of the following option is true ?(A) The grammar is LL(3)(B) The grammar is LL(1)(C) The gr...
User Avatar
Link Copied!