Use app×
Ask a Question
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

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.

← Prev Question Next Question →
0 votes
403 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.

(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
Challenge Your Friends with Exciting Quiz Games – Click to Play Now!

1 Answer

0 votes
by (120k points)
selected by
 
Best answer
Right choice is (b) n1 is necessarily equal to n2

Best explanation: SLR parser has less range of context free languages than LALR but still both n1 & n2 are same for SLR & LALR respectively.
← Prev Question Next Question →

Find MCQs & Mock Test

  1. JEE Main 2026 Test Series
  2. NEET Test Series
  3. Class 12 Chapterwise MCQ Test
  4. Class 11 Chapterwise Practice Test
  5. Class 10 Chapterwise MCQ Test
  6. Class 9 Chapterwise MCQ Test
  7. Class 8 Chapterwise MCQ Test
  8. Class 7 Chapterwise MCQ Test

Related questions

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

User Contribution to Sarthaks eConnect
Managed by Sarthaks Digitizing India
...