| Package | Description |
|---|---|
| org.vesalainen.grammar | |
| org.vesalainen.grammar.state | |
| org.vesalainen.regex |
| Modifier and Type | Method and Description |
|---|---|
NFA<Integer> |
GTerminal.createNFA(Scope<NFAState<Integer>> scope) |
| Modifier and Type | Field and Description |
|---|---|
protected Scope |
State.scope |
| Modifier and Type | Method and Description |
|---|---|
Scope |
State.getScope() |
| Modifier and Type | Method and Description |
|---|---|
DFA<T> |
NFA.constructDFA(Scope<DFAState<T>> scope)
Constructs a dfa from using first nfa state as starting state.
|
DFAState<T> |
NFAState.constructDFA(Scope<DFAState<T>> dfaScope)
Construct a dfa by using this state as starting state.
|
Set<NFAState<T>> |
NFAState.epsilonClosure(Scope<DFAState<T>> scope)
Creates a dfa state from all nfa states that can be reached from this state
with epsilon move.
|
| Constructor and Description |
|---|
DFAState(Scope<DFAState<T>> scope,
Set<NFAState<T>> nfaSet)
Creates a DFAState
|
NFA(Scope<NFAState<T>> scope)
Creates an empty nfa
|
NFA(Scope<NFAState<T>> scope,
NFA<T> other)
Construct a new nfa by cloning the other.
|
NFA(Scope<NFAState<T>> scope,
NFA<T> nfa1,
NFA<T> nfa2)
Creates a union nfa.
|
NFA(Scope<NFAState<T>> scope,
RangeSet rs)
Constructs a nfa containing two states which have transitions from first
to last
|
NFAState(Scope<NFAState<T>> scope)
Construct a nfa state which has no transitions.
|
State(Scope scope) |
State(Scope scope,
State<T> other)
Copy constructor
|
| Modifier and Type | Method and Description |
|---|---|
static NFA<Integer> |
Regex.createNFA(Scope<NFAState<Integer>> scope,
String expression)
Creates an NFA from regular expression
|
static NFA<Integer> |
Regex.createNFA(Scope<NFAState<Integer>> scope,
String expression,
int token,
Regex.Option... options)
Creates an NFA from regular expression
|
NFA<T> |
RegexParser.createNFA(Scope<NFAState<T>> scope,
String expression,
T reducer,
Regex.Option... options)
Creates a Nondeterministic finite automata from regular expression
|
NFA<T> |
RegexParserIntf.createNFA(Scope<NFAState<T>> scope,
String expression,
T reducer,
Regex.Option... options)
Creates a Nondeterministic finite automata from regular expression
|
NFA<T> |
TinyExpressionParser.createNFA(Scope<NFAState<T>> scope,
String expression,
T reducer,
Regex.Option... options) |
protected abstract NFA |
RegexParser.parse(String expression,
Scope<NFAState<T>> factory,
RegexParser.Literal literal,
Regex.Option... options) |
protected NFA<T> |
RegexParser.piece(NFA<T> atom,
Quantifier quantifier,
Scope<NFAState<T>> factory,
RegexParser.Literal literal) |
protected NFA<T> |
RegexParser.piece(RangeSet atom,
Quantifier quantifier,
Scope<NFAState<T>> factory,
RegexParser.Literal literal) |
protected NFA |
RegexParser.regexp(NFA branch,
NFA piece,
Scope<NFAState<T>> factory,
RegexParser.Literal literal) |