Use app×
QUIZARD
QUIZARD
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
169 views
in Information Technology by (120k points)
closed by
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?

(a) N1 is necessarily less than n2

(b) N1 is necessarily equal to n2

(c) N1 is necessarily greater than n2

(d) None of the mentioned

1 Answer

0 votes
by (120k points)
selected by
 
Best answer
Correct option is (b) N1 is necessarily equal to n2

The explanation: The output of lexical analyzer is output token.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...