Lines Matching full:operator
59 "http://en.wikipedia.org/wiki/Operator-precedence_parser">Operator-Precedence
105 (* variant for a binary operator. *)
218 descent parsers. For a better example, the parenthesis operator is defined like
318 "http://en.wikipedia.org/wiki/Operator-precedence_parser">Operator-Precedence
324 (* binop_precedence - This holds the precedence for each binary operator that is
328 (* precedence - Get the precedence of the pending binary operator token. *)
347 token, or -1 if the token is not a binary operator. Having a <tt>Hashtbl.t</tt>
354 The basic idea of operator precedence parsing is to break down an expression
356 the expression "a+b+(c+d)*e*f+g". Operator precedence parsing considers this
385 <em>minimal operator precedence</em> that the function is allowed to eat. For
411 operator and that it will be included in this expression:</p>
425 <p>As such, this code eats (and remembers) the binary operator and then parses
437 (* If BinOp binds less tightly with rhs than the operator after
438 * rhs, let the pending operator take rhs as its lhs. *)
445 precedence of our current operator, then we know that the parentheses associate
446 as "(a+b) binop ...". In our example, the current operator is "+" and the next
447 operator is "+", we know that they have the same precedence. In this case we'll
479 (* If BinOp binds less tightly with rhs than the operator after
480 * rhs, let the pending operator take rhs as its lhs. *)
494 <p>At this point, we know that the binary operator to the RHS of our primary
814 (* variant for a binary operator. *)
837 (* binop_precedence - This holds the precedence for each binary operator that is
841 (* precedence - Get the precedence of the pending binary operator token. *)
895 (* Parse the primary expression after the binary operator. *)
902 (* If BinOp binds less tightly with rhs than the operator after
903 * rhs, let the pending operator take rhs as its lhs. *)
