Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged grammar
20
votes
2
answers
421
GATE CSE 2001 | Question: 18
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid �...
Kathleen
3.7k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
grammar
descriptive
+
–
37
votes
6
answers
422
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
Kathleen
18.2k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
grammar
normal
+
–
19
votes
3
answers
423
GATE CSE 1991 | Question: 10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar ... what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...
Kathleen
4.5k
views
Kathleen
asked
Sep 12, 2014
Compiler Design
gate1991
grammar
compiler-design
normal
descriptive
+
–
66
votes
4
answers
424
GATE CSE 2008 | Question: 51
Match the following: $\small{\begin{array}{|ll|ll|}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$L \: = \: \left\{a^nb^mc^nd^m \mid n\: \geq1, m \geq 1\right\}$} \\\hline \text{F.} & \text{Number of formal ... $\text{E-R, F-P, G-Q, H-S}$ $\text{E-P, F-R, G-S, H-Q}$
Match the following:$$\small{\begin{array}{|ll|ll|}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$L \: = \: \lef...
Kathleen
14.1k
views
Kathleen
asked
Sep 12, 2014
Theory of Computation
gatecse-2008
normal
theory-of-computation
grammar
match-the-following
+
–
58
votes
4
answers
425
GATE CSE 2008 | Question: 50
Which of the following statements are true? Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa All $\epsilon$-productions can be removed from any context-free grammar by suitable transformations The language generated by a context-free grammar all ... trees I, II, III and IV II, III and IV only I, III and IV only I, II and IV only
Which of the following statements are true?Every left-recursive grammar can be converted to a right-recursive grammar and vice-versaAll $\epsilon$-productions can be remo...
Kathleen
13.8k
views
Kathleen
asked
Sep 11, 2014
Compiler Design
gatecse-2008
normal
compiler-design
grammar
+
–
Page:
« prev
1
...
10
11
12
13
14
15
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register