Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-free-grammar
1
votes
1
answer
331
how to convert an arbitrary CFG to an LL(1) grammar?
cse23
5.6k
views
cse23
asked
Jun 21, 2016
Compiler Design
compiler-design
context-free-grammar
ll-parser
+
–
5
votes
1
answer
332
Which of following features cannot be captured by CFG?
Which of the following features cannot be captured by CFG Syntax of if then else statements Syntax of recursive procedures Whether a variable is declared before its use Matching nested parenthesis
Which of the following features cannot be captured by CFGSyntax of if then else statementsSyntax of recursive proceduresWhether a variable is declared before its useMatch...
sh!va
8.7k
views
sh!va
asked
Jun 21, 2016
Compiler Design
compiler-design
context-free-grammar
+
–
0
votes
1
answer
333
What is Regular right part grammar Explain with Example.And where do we use such a grammar ?
Deepak jain
492
views
Deepak jain
asked
Jun 4, 2016
Compiler Design
compiler-design
context-free-grammar
+
–
9
votes
1
answer
334
ISI2013-PCB-CS-4a
Give a context-free grammar $G$ that generates $L = \{0^i1^j0^k \mid i + k = j\}$. Prove that $L = L(G)$.
Give a context-free grammar $G$ that generates $L = \{0^i1^j0^k \mid i + k = j\}$.Prove that $L = L(G)$.
go_editor
833
views
go_editor
asked
Jun 1, 2016
Theory of Computation
descriptive
isi2013-pcb-cs
context-free-grammar
theory-of-computation
+
–
2
votes
1
answer
335
CFG is ambiguous is it possible to make top down and bottom up parsing?
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct???
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct?...
Prakash059
1.9k
views
Prakash059
asked
May 3, 2016
Compiler Design
compiler-design
context-free-grammar
ambiguous-grammar
+
–
3
votes
4
answers
336
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
Harit
5.4k
views
Harit
asked
Apr 25, 2016
Compiler Design
compiler-design
context-free-grammar
parsing
numerical-answers
normal
+
–
0
votes
1
answer
337
Compiler question
I did in this way : There is conflict , right ? As A -> g. and B -> g. both going to $ and g
I did in this way :There is conflict , right ? As A - g. and B - g. both going to $ and g
worst_engineer
333
views
worst_engineer
asked
Jan 9, 2016
Compiler Design
compiler-design
context-free-grammar
parsing
lr-parser
test-series
+
–
1
votes
1
answer
338
Complier
nitish
388
views
nitish
asked
Dec 27, 2015
Compiler Design
compiler-design
ambiguous-grammar
context-free-grammar
test-series
+
–
3
votes
3
answers
339
Couting the number of reduce moves
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
shikharV
768
views
shikharV
asked
Nov 13, 2015
Compiler Design
compiler-design
context-free-grammar
compiler-tokenization
numerical-answers
+
–
2
votes
6
answers
340
Simplified CFG
Consider the following grammar $S\rightarrow Aa\mid B $ $B\rightarrow a\mid BC$ $C \rightarrow a\mid \in$ the no of productions in simplified cfg is
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
Pooja Palod
3.2k
views
Pooja Palod
asked
Oct 26, 2015
Compiler Design
compiler-design
context-free-grammar
+
–
0
votes
1
answer
341
Regular or Context Free Grammar?
Consider the following statement: if (expression) statement else statement Which of the following describe the above statement? A). Regular grammar B). Context free grammar C). Both (A) and (B) D). None of these
Consider the following statement:if (expression) statement else statement Which of the following describe the above statement?A). Regular grammarB). Context free grammarC...
prasitamukherjee
1.8k
views
prasitamukherjee
asked
Jul 17, 2015
Compiler Design
compiler-design
regular-grammar
context-free-grammar
+
–
1
votes
1
answer
342
according to me answer should be 3. give correct explanation.
sumit_62
323
views
sumit_62
asked
Dec 21, 2014
Compiler Design
compiler-design
context-free-grammar
numerical-answers
test-series
+
–
39
votes
1
answer
343
GATE IT 2008 | Question: 79
$A$ CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and a and b are terminals. $S → aS \mid A$ $A → aAb \mid bAa \mid \epsilon$ For the string "$aabbaab$" how many steps are required to derive the string and how many parse trees are there? $6$ and $1$ $6$ and $2$ $7$ and $2$ $4$ and $2$
$A$ CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and a and b are terminals.$S → aS \mid A$$A → aAb \mid bAa \m...
Ishrat Jahan
8.4k
views
Ishrat Jahan
asked
Oct 29, 2014
Compiler Design
gateit-2008
compiler-design
context-free-grammar
parsing
normal
+
–
Page:
« prev
1
...
7
8
9
10
11
12
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register