0 votes 0 votes Consider the following statements. S1: An unambiguous left recursive grammar must be CLR(1). S2: A DCFG may or may not be LL(1). Select the correct option: 1.Both S1 and S2 are true. 2.Both S1 and S2 are false. 3. S1 is false and S2 is true. 4.S1 is true and S2 is false. According to me S1 false and S2 true but answer given 1 Theory of Computation zeal theory-of-computation grammar zeal2019 + – Prince Sindhiya asked Jan 2, 2019 edited Mar 6, 2019 by ajaysoni1924 Prince Sindhiya 639 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply MiNiPanda commented Jan 2, 2019 reply Follow Share Answer given option 1 or only S1 true? 0 votes 0 votes Prince Sindhiya commented Jan 2, 2019 reply Follow Share minipanda see it now ,it was mistake and i edited 0 votes 0 votes MiNiPanda commented Jan 2, 2019 reply Follow Share To me also 3 is right :/ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes option 3 S1 is false: CLR(1) parses proper subset of Unambiguous grammars. S2 is true: DCFL has1:1 correspondence with CLR(1). So DCFG will be LR(1) but may may not be LL(1) manikantsharma answered Jul 31, 2022 manikantsharma comment Share Follow See all 0 reply Please log in or register to add a comment.