| 1 | /**
|
| 2 | * Read an identifier, producing either a name token or matching on one of the existing keywords.
|
| 3 | * For performance, we pre-generate big decision tree that we traverse. Each node represents a
|
| 4 | * prefix and has 27 values, where the first value is the token or contextual token, if any (-1 if
|
| 5 | * not), and the other 26 values are the transitions to other nodes, or -1 to stop.
|
| 6 | */
|
| 7 | export default function readWord(): void;
|