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.

파일 보기 프로젝트 열기: spark-shading-language/spark

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