org.stekikun.dolmen.automaton

Class NFA

java.lang.Object

org.stekikun.dolmen.automaton.NFA

public class NFA
extends Object

Describes a tagged Non-deterministic Finite Automaton recognizing the language of some given tagged regular expression. In particular, each transition is decorated with the set of tags that must be updated when following this transition.

Author:

Stéphane Lescuyer

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	NFA.Event Each transition in the NFA is based on an event, which is either of the following: a character is read from the character set whose index in the character set dictionary is NFA.Event.n a final state is reached and the semantic action whose index is NFA.Event.n must be performed
static class	NFA.EventKind The kinds of events that decorate transitions in the automaton
static class	NFA.Transition A transition in the NFA is an event decorated with a set of tags.

Method Summary

Modifier and Type	Method and Description
protected static Set<NFA.Transition>	firstPos(TRegular regular)
protected static Set<NFA.Transition>[]	followPos(TLexer tlexer)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

firstPos

protected static Set<NFA.Transition> firstPos(TRegular regular)

Parameters:

regular -

Returns:

the set of transitions which can start the matching of the given regular expression

followPos

protected static Set<NFA.Transition>[] followPos(TLexer tlexer)

Parameters:

tlexer -

Returns:

the set of transitions which can follow each character set of the given lexer when matching its entries' regular expressions