Lines Matching full:primary
191 production. We call this class of expressions "primary" expressions, for
193 later in the tutorial</a>. In order to parse an arbitrary primary expression,
199 (* primary
357 as a stream of primary expressions separated by binary operators. As such,
358 it will first parse the leading primary expression "a", then it will see the
360 are primary expressions, the binary expression parser doesn't need to worry
365 To start, an expression is a primary expression potentially followed by a
371 * ::= primary binoprhs *)
394 * ::= ('+' primary)* *)
426 the primary expression that follows. This builds up the whole pair, the first of
464 remember, and parse "(c+d)" as the primary expression, which makes the
466 "*" as the binop to the right of the primary. In this case, the precedence of "*" is
494 <p>At this point, we know that the binary operator to the RHS of our primary
733 (* primary *)
844 (* primary
882 * ::= ('+' primary)* *)
895 (* Parse the primary expression after the binary operator. *)
918 * ::= primary binoprhs *)
