Lines Matching refs:precedence

36 grammar, introduce new operators, change precedence levels, etc. In this
43 for most parts of the grammar and operator precedence parsing for the
45 using operator precedence parsing, it would be very difficult to allow
62     # Define > with the same precedence as <.
75     # Define = with slightly lower precedence than relationals.
135 track of whether it was an operator, and if it was, what precedence
136 level the operator is at. The precedence is only used for binary
169            (* Read the precedence if present. *)
257 operator, we register it in the precedence table. This allows the binary
259 are working on a fully-general operator precedence parser, this is all
306 so there is no need for precedence information.
362            (* Read the precedence if present. *)
418     ready> def binary : 1 (x y) 0;  # Low-precedence operator that ignores operands.
441     # Define > with the same precedence as <.
461     # Define = with slightly lower precedence than relationals.
865         (* binop_precedence - This holds the precedence for each binary operator that is
869         (* precedence - Get the precedence of the pending binary operator token. *)
870         let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1
960           (* If this is a binop, find its precedence. *)
962               let token_prec = precedence c in
979                       let next_prec = precedence c2 in
1023                (* Read the precedence if present. *)
1381            * 1 is the lowest precedence. *)