Computer Sciences > GATE 2024 Set-2 > Parsing
Consider the following augmented grammar, which is to be parsed with a SLR parser. The set of terminals is {a,b,c,d,#,&}.
S' β S
S β SS | Aa | bAc | Bc | bBa
π΄ β π#
π΅ β @
Let I0 = CLOSURE({S' β β’S}) The number of items in the set GOTO(I0, S) is
S' β S
S β SS | Aa | bAc | Bc | bBa
π΄ β π#
π΅ β @
Let I0 = CLOSURE({S' β β’S}) The number of items in the set GOTO(I0, S) is
Explanation
Correct : 4
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.