Lines Matching refs:NFA
12 #include "src/sksl/lex/NFA.h"
24 * DFAs differ only in that an NFA allows multiple states at the same time, we can find each
25 * possible combination of simultaneous NFA states and give this combination a label. These labelled
26 * nodes are our DFA nodes, since we can only be in one such unique set of NFA states at a time.
28 * As an NFA can end up in multiple accept states at the same time (for instance, the token "while"
30 * (in terms of the order in which they were added to the NFA).
37 NFAtoDFA(NFA* nfa)
41 * Returns a DFA created from the NFA.
46 // create a state representing being in all of the NFA's start states at once
162 const NFA& fNFA;