Lines Matching +full:all +full:- +full:inputs +full:- +full:2

1 .\" Copyright (C) Caldera International Inc. 2001-2002.  All rights reserved.
15 .\" All advertising materials mentioning features or use of this software
44 expr	:	expr  \'\-\'  expr
49 completely specify the way that all complex inputs
53 expr  \-  expr  \-  expr
57 (  expr  \-  expr  )  \-  expr
61 expr  \-  (  expr  \-  expr  )
72 expr  \-  expr  \-  expr
76 expr  \-  expr
88 \-  expr
95 expr  \-  expr
100 expr  \-  expr  \-  expr
106 expr  \-  expr
112 expr  \-  expr
132 .IP 2.
139 Rule 2 gives the user rather crude control over the behavior of the parser
149 always reports the number of shift/reduce and reduce/reduce conflicts resolved by Rule 1 and Rule 2.
152 possible to rewrite the grammar rules so that the same inputs are read but there are no
160 language involving an ``if-then-else'' construction:
178 simple-if
182 if-else
208 ``un-\fIELSE'\fRd''
218 by the simple-if rule to get
230 by the if-else rule.
241 can be reduced by the if-else rule to get
245 which can be reduced by the simple-if rule.
249 Once again the parser can do two valid things \- there is a shift/reduce conflict.
255 and particular inputs already seen, such as
261 a set of previously read inputs.
262 The previously read inputs are characterized by the
267 by examining the verbose (\fB\-v\fR) option output file.