| Package | Description |
|---|---|
| net.oneandone.mork.scanner |
Finite automatons.
|
| Modifier and Type | Method and Description |
|---|---|
static FA |
DFA.create(FA nfa)
Factory method to create an deterministic automaton.
|
static FA |
CompleteFA.create(FA fa,
int errorSi)
The last state of the automaton returned is the error state.
|
FA |
FABuilder.getFA() |
FA |
Minimizer.run()
The caller has to ensure a complete FA.
|
| Modifier and Type | Method and Description |
|---|---|
void |
FA.alternate(FA alt) |
static void |
Label.combineLabels(FA front,
FA back) |
static FA |
DFA.create(FA nfa)
Factory method to create an deterministic automaton.
|
static FA |
CompleteFA.create(FA fa,
int errorSi)
The last state of the automaton returned is the error state.
|
static ScannerFactory |
ScannerFactory.create(FA fa,
int errorSi,
ParserTable parserTable,
net.oneandone.sushi.util.IntBitSet whites,
PrintWriter verbose,
PrintWriter listing) |
static ScannerFactory |
ScannerFactory.createSimple(FA fa,
int errorSi,
net.oneandone.sushi.util.IntBitSet terminals) |
static List |
Modes.generate(FA fa,
ParserTable table,
net.oneandone.sushi.util.IntBitSet whites,
PrintWriter listing) |
static void |
Label.resolveConflicts(FA fa,
int[] prios) |
static void |
Modes.resolveScannerConflicts(FA fa,
Rule[] rules) |
static boolean |
Label.sameSymbols(FA fa,
int siA,
int siB) |
void |
FA.sequence(FA seq) |
| Constructor and Description |
|---|
FA(FA orig) |
Minimizer(FA fa)
Requires a complete deterministic automaton
|
Copyright © 1998–2017 1&1. All rights reserved.