Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged derivation-tree
1
votes
1
answer
1
Peter Linz Edition 4 Derivation Trees Definition 5.3 (Page No. 130)
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ? The root is labeled $S$. Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$. A vertex with a child labeled $λ$ can only have it as the rightmost child. $\text{1 & 3}$ $\text{1 & 2}$ $\text{2 & 3}$ $\text{Only 2}$
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ?The root is labeled $S$.Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$.A vertex with a ...
tarun_svbk
759
views
tarun_svbk
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
context-free-grammar
derivation-tree
+
–
1
votes
0
answers
2
CNF and GNF
Given answer is (a) but L->AB i think it is wrong because A and B produce something else Previously, so instead of L->AB there would have given like L->MN M->c1 and N->S then it was correct . if I am wrong please correct me.
Given answer is (a) but L->AB i think it is wrong because A and B produce something else Previously, so instead of L->AB there would have given like L->MN M->c1 and N->S ...
learner_geek
1.5k
views
learner_geek
asked
Aug 5, 2017
Compiler Design
theory-of-computation
context-free-language
discrete-mathematics
derivation-tree
conjunctive-normal-form
+
–
1
votes
0
answers
3
CNF and GNF
Is it mandatory in GNF that first element in production must be terminal(I am considering there is no Left recursion) Is it mandatory in CNF that in production only two nonterminal or terminal should be there Can we not take in one production as two nonterminal and one terminal OR one terminal and two nonterminal
Is it mandatory in GNF that first element in production must be terminal(I am considering there is no Left recursion)Is it mandatory in CNF that in production only two no...
learner_geek
4.8k
views
learner_geek
asked
Aug 5, 2017
Theory of Computation
theory-of-computation
derivation-tree
context-free-language
conjunctive-normal-form
+
–
2
votes
2
answers
4
[TOC] CNF Tree Depth
1. Assume that we have CNF tree of depth of h(Assume root at height 0).What is the maximum yeild possible in terms of h? 2. Assume that we have a string of length n,what is the min and max height of parse tree possible in CNF. Please explain
1. Assume that we have CNF tree of depth of h(Assume root at height 0).What is the maximum yeild possible in terms of h?2. Assume that we have a string of length n,what i...
rahul sharma 5
2.4k
views
rahul sharma 5
asked
Jan 12, 2017
Theory of Computation
theory-of-computation
context-free-language
conjunctive-normal-form
derivation-tree
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register