C# Класс 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.

Показать файл Открыть проект

Private Properties

Свойство	Тип	Описание
MakePath	void
MarkAccept	void
MkState	QUT.Gplex.Automaton.NState

Открытые методы

Метод	Описание
NfsaInstance ( StartState ss, NFSA parent ) : System

Приватные методы

Метод	Описание
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

Описание методов

NfsaInstance() публичный Метод

public NfsaInstance ( StartState ss, NFSA parent ) : System
ss	QUT.Gplex.Parser.StartState
parent	NFSA
Результат	System