Lines Matching defs:choice
490 // * Choice nodes
523 // * Choice nodes are implemented as follows:
524 // For each choice except the last {
527 // <generate code to test for choice>
531 // <generate code to test for last choice>
550 // by the choice nodes, whereas the registers are saved and restored by
567 // * Choice nodes have 1-character lookahead.
568 // A choice node looks at the following character and eliminates some of
994 // This is called as we come into a loop choice node and some other tricky
1017 // Here we have a concrete backtrack location. These are set up by choice
2489 // this alternative and back to this choice node. If there are variable
2569 // This class is used when generating the alternatives in a choice node. It
2615 /* Code generation for choice nodes.
2618 * choice. If the quick check succeeds then it jumps to the continuation to
2620 * it falls through to the next choice.
2792 // Quick check was generated for this choice.
2795 // On the last choice in the ChoiceNode we generated the quick
2812 // If this is not the first choice then there could be slow checks from
3121 TableEntryBodyPrinter(StringStream* stream, ChoiceNode* choice)
3122 : stream_(stream), choice_(choice) { }
3128 choice(),
3131 choice()->alternatives()->at(i).node());
3137 ChoiceNode* choice() { return choice_; }
3790 // choice node set up and backtrack. If the first alternative fails then
4889 // Find loop min-iteration. It's the value of the guarded choice node
