Consider the following grammar GS → F | HF → p | cH → d | cWhere S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct?S1. LL(1) can parse all strings that are generated using grammar GS2. LR(1) can parse all string that are generated using grammar G

Consider the following grammar GS → F | HF → p | cH → d

1.	Consider the following grammar GS → F \| HF → p \| cH → d \| cWhere S, F, and H are non-terminal symbols, p, d, and c are terminal symbols. Which of the following statement(s) is/are correct?S1. LL(1) can parse all strings that are generated using grammar GS2. LR(1) can parse all string that are generated using grammar G
A.	Only S1
B.	Only S2
C.	Both S1 and S2
D.	Neither S1 nor S2
Answer» E.

Discussion

No Comment Found

Related MCQs

Given the following expression grammar :E → E ⋆ F | F + E | FF→ F - F| idWhich of the following is true?
Consider the following grammarS → m | mn | mnoChoose correct statement from the following:
Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals {S, A} and terminals {a, b}.S → aA {print 1}S → a {print 2}A → Sb {print 3}Using the above SDTS, the output printed by a bottom-up parser, for the input aab is:
Consider the following statements.S1 : Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).S2 : For any context-free grammar, there is a parser that takes at most O(n3) time to parse a string of length n.Which one of the following option is correct?
Consider the following two sets of LR(1) items of an LR(1) grammar.X → c.X, c/d X → c.X, $X → .cX, c/d X → .cX, $X → .x, c/d X → .d, $Which of the following statements related to merging of the two sets in the corresponding LALRparser is/are FALSE?1. Cannot be merged since look aheads are different.2. Can be merged but will result in S-R conflict.3. Can be merged but will result in R-R conflict.4. Cannot be merged since goto on c will lead to two different sets.
Among simple LR (SLR), canonical LR, and look – ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?
In LR(k) parsing, when the value of k is omitted, it is assumed to be ______.
A top-down parser generates
Match the following:(P)Lexical analysis(i)Leftmost derivation(Q)Top down parsing(ii)Type checking(R)Semantic analysis(iii)Regular expressions(S)Runtime environments(iv)Activation records
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is :

Discussion

No Comment Found

Related MCQs

Reply to Comment