edited by
688 views
0 votes
0 votes

Consider the following statements regarding the “Parsing Table” of a shift reduce parser, for any given grammar

  1. No. of states/ size of parse table is same for all Shift-Reduce Parsers.
  2. No. of states/ size of parse table in LR(0), SLR(1) and LALR(1) are same, whereas, may be more in CLR(1)
  3. No. of Shifts are same for all Shift-Reduce Parsers
  4. No. of Shifts are same for all Shift-Reduce Parsers, except for CLR(1)
  5. No. of GOTO are same for all Shift-Reduce Parsers
  6. No. of GOTO are same for all Shift-Reduce Parsers, except for CLR(1)
  7. No. of reduce are same for all Shift-Reduce Parsers
  8. No. of reduce are same for all Shift-Reduce Parsers, except for CLR(1)
  9. No. of reduce may be different for all Shift-Reduce Parsers, as we insert reduces based on different criterias for every SR Parsers.
  10. No. of blank space/errors increases as we move from LR(0) towards CLR(1)
  11. No. of blank space/errors decreases as we move from LR(0) towards CLR(1)
  12. No. of conflicts increases as we move from LR(0) towards CLR(1)
  13. No. of conflicts decreases as we move from LR(0) towards CLR(1)
  14. Parsing power decreases as we move from LR(0) towards CLR(1)
  15. Parsing power increases as we move from LR(0) towards CLR(1)

The summation of the statement numbers corresponding to CORRECT statement is _______  (For example, if statement 1 and 7 are correct, answer would be 1+7, i.e. 8)

edited by

1 Answer

1 votes
1 votes
It is difficult to determine the correctness of the given statements without more information. "Parsing table" could refer to a table used in shift-reduce parsing, which is a type of parser used in natural language processing and other areas. Shift-reduce parsers use a stack to store information about the current state of the parse, and they shift symbols onto the stack and reduce the stack according to a set of rules. However, without knowing more about the specific statements and their context, it is impossible to determine which, if any, of the given statements are correct.

Related questions

0 votes
0 votes
2 answers
1
sripo asked Nov 1, 2018
2,378 views
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]
0 votes
0 votes
1 answer
2
sripo asked Nov 1, 2018
540 views
For given production for a LR(1) grammarB->b.C ,$|c here C is non terminalC->c. ,$|c and here c is terminal. $|c are lookup symbolsWill there be a shift reduce conflict...
0 votes
0 votes
1 answer
3
Sourabh Kumar asked Jan 14, 2016
356 views