Lines Matching refs:precedence

351                 // The start state for a precedence DFA depends on the current
352                 // parser precedence, and is provided by a DFA method.
384                      * If this is a precedence DFA, we use applyPrecedenceFilter
385                      * to convert the computed start state to a precedence start
387                      * appropriate start state for the precedence level rather
1143      * Because we have special information, that these are precedence predicates,
1146      * that the current precedence level is greater than or equal to the precedence
1162      * enter the loop as it is consistent with the notion of operator precedence.
1165      * The solution requires a different DFA start state for each precedence level.
1172      * It's also the case that the filter evaluates precedence predicates and
1173      * resolves conflicts according to precedence levels. For example, for input
1185      * resolution based upon rules of operator precedence fits with our
1188      * We noticed a problem where a recursive call resets precedence to 0.
1195      * to a rule invocation with precedence level 0".
1201      * used by a precedence DFA for a particular precedence value. The transformation
1205      * - Evaluate the precedence predicates for each configuration using
1213      *    part of the precedence alternatives of the transformed left-recursive
1219      *    preferred precedence level.
1242      *                      for a precedence DFA at a particular precedence level
1844      * No. Predicates, including precedence predicates, are only
1881      * How do we know this optimization doesn't mess up precedence in
1886      * of an expression. The precedence actually doesn't matter when
1888      * parsing rule expr that we must use the precedence to get the
2076                 $pt->precedence