...
Theory-of-Computation
October 6, 2023
Theory-of-Computation
October 6, 2023
Theory-of-Computation
October 6, 2023
Theory-of-Computation
October 6, 2023

UGC NET Dec-2020 and June-2021 Paper-2

Question 1
Given below are two statements
Statement I: LL(1) and LR are examples of Bottom up parsers.
Statement II: Recursive descent parser and SLR are examples of Top down parsers
In light of the above statements, choose the correct answer from the options given below
A
Both Statement I and Statement II are false
B
Both Statement I and Statement II are true
C
Statement I is false but Statement II is true
D
Statement I is true but Statement II is false
Question 1 Explanation: 
LL(1) is a Non Recursive descent Top down parser. LR is Bottom up Parser.
Recursive Descent Parser is top down parser with backtracking and SLR is one of four LR-Parsers(LR(0),SLR(1),LALR(1),CLR(1)).
Since LR is bottom up parser so SLR is example of Bottom up parser.
Correct Answer: A
Question 1 Explanation: 
LL(1) is a Non Recursive descent Top down parser. LR is Bottom up Parser.
Recursive Descent Parser is top down parser with backtracking and SLR is one of four LR-Parsers(LR(0),SLR(1),LALR(1),CLR(1)).
Since LR is bottom up parser so SLR is example of Bottom up parser.
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!!