...
Question 2979 – 2013 December UGC NET Paper 1
February 13, 2024
Question 10229 – Theory-of-Computation
February 13, 2024
Question 2979 – 2013 December UGC NET Paper 1
February 13, 2024
Question 10229 – Theory-of-Computation
February 13, 2024

Question 10195 – Theory-of-Computation

Consider a grammar with the following productions

S → a∝b|b∝c| aB
S → ∝S|b
S → ∝b b|ab
S ∝ → bd b|b 

The above grammar is:

Correct Answer: D

Question 7 Explanation: 
S ∝→ [violates context free]
Because LHS must be single non-terminal symbol.
S ∝→ b [violates CSG]
→ Length of RHS production must be atleast same as that of LHS.
Extra information is added to the state by redefining iteams to include a terminal symbol as second component in this type of grammar.
Ex: [A → αβa]
A → αβ is a production, a is a terminal (or) right end marker $, such an object is called LR(k).
So, answer is (D) i.e., LR(k).
A
Context free
B
Regular
C
Context sensitive
D
LR(k)
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!