Start learning →

GATE CSE Parsing — practice questions

Explore 2 free Parsing questions in GATE CSE Compilerdesign. Open each question or exercise to read its content, reference answers and available explanation.

Practise Parsing with Quill →

Parsing questions and exercises with answers

Showing questions 1–2 of 2.

Match the parser to its key propertyRead the answer and worked solution →Parsing — true or false?Read the answer and worked solution →

Worked practice questions

Match the parser to its key property

Read exercise and reference answers
Matching pairs
  1. A
    LL(1)
    B
    Top-down, predicts via 1 lookahead
  2. A
    LR(1)
    B
    Bottom-up, 1 lookahead, most powerful linear
  3. A
    LALR(1)
    B
    LR(1) state-merged, used in yacc/bison
  4. A
    SLR
    B
    Simpler bottom-up, weaker than LALR

Open this exercise →

Parsing — true or false?

Read exercise and reference answers
Questions
  1. Statement is true
    Yes
    Statement
    Every LL(1) grammar is also LR(1).
  2. Statement is true
    No
    Statement
    Left recursion is allowed in LL parsers.
  3. Statement is true
    Yes
    Statement
    Ambiguous grammars cannot be deterministically parsed.
  4. Statement is true
    No
    Statement
    LR(0) is more powerful than SLR(1).

Open this exercise →

How to practise

  1. Choose a Parsing question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Compilerdesign topics

Phases