Compiles a regular expression like syntax to fast deterministic finite automata.
Useful for pattern matching against non-string sequences.
Example
This example matches Hangul syllables. The symbols defined in the machine are Unicode character categories which could be mapped from code points.
Machine definition:
# define symbolsX = 0; # Other characterL = 1; # Leading consonantV = 2; # Medial vowelT = 3; # Trailing consonantLV = 4; # Composed <LV> syllableLVT = 5; # Composed <LVT> syllableM = 6; # Tone mark# define variablesdecomposed = L V T?;partial = LV T?;composed = LVT;# define main state machine patternmain = (decomposed | partial | composed) M?;
Visualized, the machine looks like this (double circles are accepting states):
Compiling and using the machine:
import { compile } from 'dfa/compile';import fs from 'fs';let stateMachine = compile(fs.readFileSync('hangul.machine', 'utf8'));// find matchesfor (let [startIndex, endIndex] of stateMachine.match([0, 1, 2, 3, 0, 4, 6]) { console.log('match:', startIndex, endIndex);}
Output:
match: 1 3match: 5 6
Syntax
A state machine file contains a list of assignment statements. Comments are also allowed
and are started with the # character. Each statement is an assignment of a variable name
to a value or expression. Assigning a variable to a number produces a symbol, which is
added to the state machine's alphabet. Assigning a variable to an expression allows
for substitutions into later expressions. The special main variable should always be
assigned to at the end of the file, and is the final expression that will be compiled.
A subset of common regular expression syntax is supported. A list of operators and their
precedence is below. Operators with the same precedence are evaluated left to right.