C# Class QUT.Gplex.Automaton.NFSA.NfsaInstance

This class represents the NFSA for all the regular expressions that begin on a given start condition. Each NfsaInstance may have two "start" states, corresponding to the anchored and unanchored pattern starts.

Afficher le fichier Open project: spark-shading-language/spark

Private Properties

Свойство	Type	Description
MakePath	void
MarkAccept	void
MkState	QUT.Gplex.Automaton.NState

Méthodes publiques

Méthode	Description
NfsaInstance ( StartState ss, NFSA parent ) : System

Private Methods

Méthode	Description
MakePath ( RegExTree tree, QUT.Gplex.Automaton.NState startState, QUT.Gplex.Automaton.NState endState ) : void	Create a transition path in the NFSA from the given start state to the given end state, corresponding to the RegEx tree value. The method may (almost always does) create new NFSA states and recurses to make paths for the subtrees of the given tree.
MarkAccept ( QUT.Gplex.Automaton.NState acpt, RuleDesc rule ) : void
MkState ( ) : QUT.Gplex.Automaton.NState

Method Details

NfsaInstance() public méthode

public NfsaInstance ( StartState ss, NFSA parent ) : System
ss	QUT.Gplex.Parser.StartState
parent	NFSA
Résultat	System