Lines Matching +full:side +full:- +full:by +full:- +full:side

1 .\" Copyright (C) Caldera International Inc. 2001-2002.  All rights reserved.
18 .\" This product includes software developed or owned by Caldera
24 .\" USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
51 The parser produced by Yacc consists
107 the right hand side of a grammar rule,
109 an instance of the rule, replacing the right hand side
110 by the left hand side.
114 action (represented by a ``.'') is often a reduce action.
139 symbols on the right hand side (three in this case).
143 right side of the rule).
155 on the left side of the rule, perform what is in
163 In particular, the lookahead token is cleared by a shift, and
164 is not affected by a goto.
174 state where the right hand side of the rule was first seen.
175 The parser then behaves as if it had seen the left side at that time.
176 If the right hand side of the rule is empty,
180 The reduce action is also important in the treatment of user-supplied
196 The pseudo-variables $1, $2, etc., refer to the value stack.
211 cannot be followed by anything that would result
231 .B \-v
234 is produced, with a human-readable description of the parser.
316 the parser reduces by rule 2.
320 This rule has two symbols on the right hand side, so
335 In state 5, the only action is to reduce by rule 3.
336 This has one symbol on the right hand side, so one state, 5,
340 the left side of rule 3,
343 In state 4, the only action is to reduce by rule 1.
350 indicated by ``$end'' in the