Register

Recent questions tagged grammar

0 votes
2 answers
101
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
104
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
107
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
109
#compiler
User Avatar
1 votes
1 answer
112
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
113
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
114
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
116
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
117
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
0 votes
0 answers
119
Does operator grammar belong to both NCFL and DCFL?
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the language described by the operator grammar be both $DCFL$ or $NCFL$?
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the langu...
User Avatar
0 votes
0 answers
120
Grammer
Which of the following problem is undecidable? A) membership problem for CFL B) membership problem for regular language C)membership problem for csl D)membership problem for type O language
Which of the following problem is undecidable?A) membership problem for CFLB) membership problem for regular languageC)membership problem for cslD)membership problem for ...
User Avatar
Page: