Register

LL grammar

• edited by
695 views
0 votes
0 votes
LL grammar for the language:

$L = \{a^mb^nC^{n+m} \mid  m\geq 0, n\geq 0\}$ is
 

a. S->aSc | S1 ; S1 -> bS1c | lambda

b. none
• edited by
User Avatar

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

0 votes
0 votes
1 answer
1
rexritz asked Oct 22, 2023
616 views
Which of the following is LL(1) grammar?
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$ B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow \varepsilon $ C) $E\rightarrow E+E\mid (E) \mid id$
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow...
User Avatar
2 votes
2 votes
1 answer
2
sripo asked Nov 10, 2018
3,241 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,961 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,942 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!