Home | History | Annotate | Download | only in tutorial

Lines Matching full:primary

363 class of expressions "primary" expressions, for reasons that will become more
365 parse an arbitrary primary expression, we need to determine what sort of
370 /// primary
455 as a stream of primary expressions separated by binary operators. As such,
456 it will first parse the leading primary expression "a", then it will see the
458 are primary expressions, the binary expression parser doesn't need to worry
463 To start, an expression is a primary expression potentially followed by a
469 /// ::= primary binoprhs
497 /// ::= ('+' primary)*
522 // Parse the primary expression after the binary operator.
529 the primary expression that follows. This builds up the whole pair, the first of
567 remember, and parse "(c+d)" as the primary expression, which makes the
569 "*" as the binop to the right of the primary. In this case, the precedence of "*" is
594 <p>At this point, we know that the binary operator to the RHS of our primary
833 // primary
1039 /// primary
1053 /// ::= ('+' primary)*
1068 // Parse the primary expression after the binary operator.
1086 /// ::= primary binoprhs