Lines Matching refs:groupings

1173 "syntactic groupings" and give rules for constructing them from their
1241    The syntactic groupings of C include the expression, the statement,
1812 all tokens and groupings.  Moreover, the output parser is equipped with
1844    The job of the Bison parser is to group tokens into groupings
2041 the C data type for semantic values of both tokens and groupings (*note
2093    The groupings of the rpcalc "language" defined here are the
2640 pseudo-variable `@$' for groupings.
3534 equivalent groupings.  The symbol name is used in writing grammar rules.
3669 says that two groupings of type `exp', with a `+' token in between, can
3712 sequence of zero or more `exp' groupings:
3788 tokens and groupings, and by the actions taken when various groupings
3835 of tokens and groupings.  For example, a numeric constant may need type
3851      Names: Token Decl.)  and for groupings with the `%type' Bison
3864 groupings.
3896 This rule constructs an `exp' from two smaller `exp' groupings
3899 groupings, which are the first and third symbols on the right hand side
3924 groupings on the stack _before_ those that match the current rule.
4261 values, since all tokens and groupings always use the same type.
4291    The most obvious way for building locations of syntactic groupings
6061 actions to keep track of the textual locations of tokens and groupings,
6376 When the last N tokens and groupings shifted match the components of a
6378 called "reduction".  Those tokens and groupings are replaced on the
6427 last N tokens and groupings match a rule.  This is because such a
6434 parser can perform one or more reductions of tokens and groupings on
6788 means that a certain number of tokens or groupings are taken off the
6807 zero or more `word' groupings.
6867 `word' or `redirect' groupings.  The individual definitions of