Lines Matching full:construct
619 A formal grammar is a mathematical construct. To define the language
712 of the whole construct from the semantic values of its parts. For example,
1083 construct, as shown in the previous section (@pxref{Simple GLR Parsers}).
1234 construct.
1398 The grammar rules define how to construct each nonterminal symbol from its
1555 that the rule is going to construct. Assigning a value to @code{$$} is the
2351 The Bison construct @code{%type} is used for declaring nonterminal
3449 the same construct is defined using @dfn{right recursion}:
3597 components matched by the rule with the construct @code{$@var{n}},
3601 references construct @code{$@var{name}} or @code{$[@var{name}]}.
3641 references construct.
3771 in advance, so you must use the @samp{$<@dots{}>@var{n}} construct to
3782 duration of @var{statement}. To parse this construct, we must put
4117 In addition, the named references construct @code{@@@var{name}} and
4120 references construct.
7530 parser tables Bison can currently construct, so they may then be preferable.
7540 table construction algorithm. LALR can be a quick way to construct parser
8156 construct itself by a complicated syntactic structure---the ``declarator''.
8201 construct @samp{hex (@var{hex-expr})}. After the keyword @code{hex} comes
8252 abort the parsing of one construct and resume in some larger construct.
8266 construct, this error rule will apply, and then the action for the
8287 If this rule acts within the @code{hex} construct, it is not going to abort
8288 that construct (since it applies to an inner level of parentheses within
8289 the construct
8290 the @code{hex} construct should be parsed with the flag still in effect.
8293 @code{hex} construct or might not, depending on circumstances? There is no
8294 way you can write the action to determine whether a @code{hex} construct is
11320 to construct a tree that does represent the structure it has
11561 @deffn {Construct} /* @dots{} */
11562 @deffnx {Construct} // @dots{}
12100 A language construct that is (in general) grammatically divisible;
12130 @item Language construct
12174 A grammar symbol standing for a grammatical construct that can
12176 words, a construct that is not a token. @xref{Symbols}.
