1 votes 1 votes closed with the note: duplicate of https://gateoverflow.in/1251/gate2007-53 Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false Compiler Design compiler-design parsing regular-language + – indrajeet asked Dec 2, 2016 • retagged Jul 4, 2017 by Arjun indrajeet 640 views comment Share Follow See 1 comment See all 1 1 comment reply saurabh rai commented Dec 2, 2016 reply Follow Share https://gateoverflow.in/1251/gate2007-53 0 votes 0 votes Please log in or register to add a comment.