Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tarun_svbk
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by tarun_svbk
2
votes
2
answers
1
Brute Force Parsing
Which of the following can be said about the Exhaustive search parsing or brute force parsing ? It is inefficient as the time taken is proportional to the length of the string. The parser always terminates on the strings in the $L(G)$. The parser always terminates on the strings not in $L(G)$. $\text{1 & 2}$ $\text{2 & 3}$ $\text{1 & 3}$ $\text{1, 2 & 3}$
Which of the following can be said about the Exhaustive search parsing or brute force parsing ?It is inefficient as the time taken is proportional to the length of the st...
1.5k
views
asked
Feb 24, 2018
Theory of Computation
parsing
theory-of-computation
compiler-design
+
–
1
votes
1
answer
2
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 ...
721
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
context-free-grammar
derivation-tree
+
–
1
votes
2
answers
3
Simple Grammar
Consider Grammar G with the following characteristic- $A → ax$, where $A ∈ V$, $a ∈ T$, $x ∈ V^*$, and any pair $( A, a )$ occurs at most once in $P$. For example, $S → aA \mid aB...,$ is not a grammar of type $G$ because the pair $(S,a)$ occur in two productions. ... string w belonging to $L(G)$ ? $\mid w \mid^3$ $\mid w \mid$ $2^{\mid w \mid}$ Not a function of $\mid w \mid$ alone.
Consider Grammar G with the following characteristic-$A → ax$, where $A ∈ V$, $a ∈ T$, $x ∈ V^*$, and any pair $( A, a )$ occurs at most once in $P$. For example,...
2.0k
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
grammar
context-free-grammar
+
–
0
votes
0
answers
4
Sentential forms
Restricting only to the leftmost derivations, how many sentential forms can exhaustive search parsing generate ? $O(P^{\mid w \mid})$ $O(P^{\mid w \mid +1})$ $O(P^{2\mid w \mid})$ $O(P^{2\mid w \mid + 1})$ where, $P$ is the number of productions and w is the word to be generated.
Restricting only to the leftmost derivations, how many sentential forms can exhaustive search parsing generate ? $O(P^{\mid w \mid})$$O(P^{\mid w \mid +1})$$O(P^{2\mid w ...
369
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
grammar
+
–
0
votes
0
answers
5
Peter Linz Edition 4 Example 5.13 (Page No. 144)
Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct? There is no context free grammar possible for $L$. There exists a simple grammar for $L$. There exists an unambiguous grammar for $L$. There exists an ambiguous grammar for $L$.
Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct?There is no context free grammar possible...
312
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
grammar
inherently-ambiguous
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register