Lines Matching full:parser

68 Yacc detects such ambiguities when it is attempting to build the parser.
69 It is instructive to consider the problem that confronts the parser when it is
74 When the parser has read the second expr, the input that it has seen:
79 The parser could
86 The parser would then read the final part of the input:
93 Alternatively, when the parser has seen
114 the parser can do two legal things, a shift or a reduction, and has no way of
118 It may also happen that the parser has a choice of two legal reductions;
123 When there are shift/reduce or reduce/reduce conflicts, Yacc still produces a parser.
139 Rule 2 gives the user rather crude control over the behavior of the parser
143 require a more complex parser than Yacc can construct.
145 be done before the parser can be sure which rule is being recognized.
147 and leads to an incorrect parser.
151 In general, whenever it is possible to apply disambiguating rules to produce a correct parser, it i…
154 For this reason, most previous parser generators
210 In this example, consider the situation where the parser has seen
249 Once again the parser can do two valid things \- there is a shift/reduce conflict.
250 The application of disambiguating rule 1 tells the parser to shift in this case,
264 of the parser.
284 the grammar rules active in the state, and the parser actions.
287 Thus in the example, in state 23 the parser has seen input corresponding
293 The parser can do two possible things.
309 the parser reduces by grammar rule 18:
324 the behavior and construction of the parser than can be covered here.