The GATE Grind

GATE 2007 CS – Question 53

Compiler Design · Parsing and Syntax Analysis · 2 marks · Multiple choice

P: Every regular grammar is LL(1). Q: Every regular set has an LR(1) grammar. Which is TRUE?

  1. P and Q true
  2. P true, Q false
  3. P false, Q true
  4. Both false

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) P false, Q true

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Parsing and Syntax Analysis questions

All Parsing and Syntax Analysis questions →