Debian Codegraph @

morfologik-tools/src/main/package/examples/01-fsa-build.txt

raw
1 # This example constructs a finite state automaton (FSA) out
2 # of byte sequences in the input file:
3 #
4 # https://en.wikipedia.org/wiki/Finite-state_machine
5 #
6 # Each sequence is encoded as one path in the automaton. Input are LF-separated
7 # byte sequences.
8 #
9
10 # This example constructs an automaton serialized with FSA5 (Jan Daciuk's fsa_build compatible format).
11 java -jar ../lib/${project.artifactId}-${project.version}.jar fsa_build --input 01-fsa-build.input --output 01-fsa-build.fsa5 --format fsa5
12
13 # This example uses CFSA2, a custom format that is packed slightly better, but slower at runtime.
14 java -jar ../lib/${project.artifactId}-${project.version}.jar fsa_build --input 01-fsa-build.input --output 01-fsa-build.cfsa2 --format cfsa2