Machine-translated by Google. Questions are authored in English.
Top

Discussion

Bison can be asked to emit a generalised LR parser instead of its usual table because

  • A.some grammars are ambiguous or need unbounded lookahead
  • B.the generalised parser is faster on every ordinary grammar
  • C.the default construction cannot handle recursion of any kind
  • D.generalised parsing removes the need for any semantic actions

Answer: A

Natural language grammars and a few awkward programming language constructs defeat a single deterministic table. The generalised mode explores the alternatives and discards those that fail, at the cost of the linear time guarantee the ordinary table provides.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.