Register

Recent questions tagged grammar

0 votes
0 answers
100
Peter Linz Edition 4 Exercise 1.2 Question 15 (Page No. 29)
Find grammars for the following languages on Σ = {a}. (a) L = {w : |w| mod 3 = 0}. (b) L = {w : |w| mod 3 > 0}. (c) L = {w : |w| mod 3 ≠ |w| mod 2}. (d) L = {w : |w| mod 3 ≥ |w| mod 2}.
Find grammars for the following languages on Σ = {a}.(a) L = {w : |w| mod 3 = 0}.(b) L = {w : |w| mod 3 0}.(c) L = {w : |w| mod 3 ≠ |w| mod 2}.(d) L = {w : |w| mod 3 ...
User Avatar
0 votes
2 answers
103
Peter Linz Edition 4 Exercise 1.2 Question 12 (Page No. 28)
Give a simple description of the language generated by the grammar with productions $S \rightarrow aA,$ $A \rightarrow bS,$ $S \rightarrow λ.$
Give a simple description of the language generated by the grammar with productions$S \rightarrow aA,$$A \rightarrow bS,$$S \rightarrow λ.$
User Avatar
0 votes
1 answer
106
how to check grammar is lr(1)?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals. Does LR(1) can parse all strings that are generated by grammar G.? Please any one help me to how to check it?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.Does LR(1) can parse all strings that are generated by gr...
User Avatar
0 votes
1 answer
109
Formal Languages
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} . L complement is Regular CFL but not regular CSL but not CSL DCFL
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} .L complement isRegularCFL but not regularCSL but not CSLDCFL
User Avatar
0 votes
1 answer
111
#compiler
User Avatar
1 votes
1 answer
114
MadeEasy Test Series: Compiler Design - Grammar
Consider the following grammar G shown Below : S → abS | ScS | d | c The number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol considered terminal?
Consider the following grammar G shown Below :S → abS | ScS | d | cThe number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol cons...
User Avatar
0 votes
1 answer
115
context free grammer
consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL?
consider following grammerS → aSb / aSbb / aSbbb / …..is language generated by above grammer is DCFL?
User Avatar
0 votes
2 answers
116
MadeEasy Test Series: Theory Of Computation - Grammar
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
User Avatar
0 votes
1 answer
118
MadeEasy Test Series: Theory Of Computation - Grammar
G1: S-→ aSa| bSb|e G2:S--→ aaS|bbS| e the shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
G1: S-→ aSa| bSb|eG2:S → aaS|bbS| ethe shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
User Avatar
1 votes
0 answers
119
PARSER
An $\epsilon$ free LL(1) grammar is also a SLR(1) and hence LALR(1) and LR(1) too. Is this statement true ?
An $\epsilon$ free LL(1) grammar is also a SLR(1) and hence LALR(1) and LR(1) too.Is this statement true ?
User Avatar
Page: