All mock tests are FREE till 31 December — register to save your progress
Unit 8 · Theory of Computation and Compilers Paper 2 CS · November 2021

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

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. Both Statement I and Statement II are false

Explanation

LL(1) and recursive descent are top-down; LR and SLR are bottom-up. Both statements put a parser in the wrong class, so both are false.

More Theory of Computation and Compilers questions