llvm/unittests/TableGen/AutomataAutomata.inc

#ifdef GET_BinPackerAutomaton_DECL
// The type of an action in the BinPackerAutomaton automaton.
BinPackerAutomatonAction;

// Input NFA has 64 states with 1152 transitions.
// Generated DFA has 508 states with 6902 transitions.

// A zero-terminated sequence of NFA state transitions. Every DFA
// transition implies a set of NFA transitions. These are referred
// to by index in BinPackerAutomatonTransitions[].
const std::array<NfaStatePair, 31465> BinPackerAutomatonTransitionInfo = …;

// A transition in the generated BinPackerAutomaton DFA.
struct BinPackerAutomatonTransition { … };

// A table of DFA transitions, ordered by {FromDfaState, Action}.
// The initial state is 1, not zero.
const std::array<BinPackerAutomatonTransition, 6902> BinPackerAutomatonTransitions = …;

#endif  // GET_BinPackerAutomaton_DECL
#ifdef GET_NfaAutomaton_DECL
// The type of an action in the NfaAutomaton automaton.
NfaAutomatonAction;

// Input NFA has 4 states with 8 transitions.
// Generated DFA has 3 states with 4 transitions.

// A zero-terminated sequence of NFA state transitions. Every DFA
// transition implies a set of NFA transitions. These are referred
// to by index in NfaAutomatonTransitions[].
const std::array<NfaStatePair, 6> NfaAutomatonTransitionInfo = …;

// A transition in the generated NfaAutomaton DFA.
struct NfaAutomatonTransition { … };

// A table of DFA transitions, ordered by {FromDfaState, Action}.
// The initial state is 1, not zero.
const std::array<NfaAutomatonTransition, 4> NfaAutomatonTransitions = …;

#endif  // GET_NfaAutomaton_DECL
#ifdef GET_SimpleAutomaton_DECL
// The type of an action in the SimpleAutomaton automaton.
SimpleAutomatonAction;

// Input NFA has 4 states with 5 transitions.
// Generated DFA has 4 states with 5 transitions.

// A zero-terminated sequence of NFA state transitions. Every DFA
// transition implies a set of NFA transitions. These are referred
// to by index in SimpleAutomatonTransitions[].
const std::array<NfaStatePair, 10> SimpleAutomatonTransitionInfo = …;

// A transition in the generated SimpleAutomaton DFA.
struct SimpleAutomatonTransition { … };

// A table of DFA transitions, ordered by {FromDfaState, Action}.
// The initial state is 1, not zero.
const std::array<SimpleAutomatonTransition, 5> SimpleAutomatonTransitions = …;

#endif  // GET_SimpleAutomaton_DECL
#ifdef GET_TupleAutomaton_DECL
// The type of an action in the TupleAutomaton automaton.
TupleAutomatonAction;

// Input NFA has 4 states with 6 transitions.
// Generated DFA has 4 states with 6 transitions.

// A zero-terminated sequence of NFA state transitions. Every DFA
// transition implies a set of NFA transitions. These are referred
// to by index in TupleAutomatonTransitions[].
const std::array<NfaStatePair, 8> TupleAutomatonTransitionInfo = …;

// A transition in the generated TupleAutomaton DFA.
struct TupleAutomatonTransition { … };

// A table of DFA transitions, ordered by {FromDfaState, Action}.
// The initial state is 1, not zero.
const std::array<TupleAutomatonTransition, 6> TupleAutomatonTransitions = …;

#endif  // GET_TupleAutomaton_DECL