C# Класс Microsoft.Automata.Z3.TreeRule

Describes a symbolic tree transduction rule.

Наследование: AcceptorBase

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

Метод	Описание
EnumerateStatesInOutput ( ) : int>>.IEnumerable	Enumerate all occurrences of $trans(q,subtree_id) in the output as pairs (q,subtree_id).
Equals ( object obj ) : bool
GetAcceptorRule ( ) : TreeRule	Include all states in the output also in the lookahead. Delete the output.
GetHashCode ( ) : int
IsTrueForAllStates ( bool>.Func phi ) : bool	Returns true iff all states that occur in the rule satisfy the predicate phi.
Normalize ( ) : TreeRule	Include all states in the output also in the lookahead.
ToString ( ) : string

Метод	Описание
CheckForAllStates ( Expr output, bool>.Func phi ) : bool
GetStatesOf ( Expr t ) : IEnumerable	Enumerates all pairs Expr[]{state,child_variable}.
GetVariableIndex ( Expr x ) : int
MkIdRule ( RankedAlphabet A ) : TreeRule
TreeRule ( Expr state, FuncDecl symbol, Expr guard, Expr output ) : System	Create a tree rule with regular lookahead.
TreeRule ( Expr state, FuncDecl symbol, Expr guard, Expr output, int rank ) : System	Create a tree rule with empty regular lookahead.

Enumerate all occurrences of $trans(q,subtree_id) in the output as pairs (q,subtree_id).

public EnumerateStatesInOutput ( ) : int>>.IEnumerable
Результат	int>>.IEnumerable

public Equals ( object obj ) : bool
obj	object
Результат	bool

Include all states in the output also in the lookahead. Delete the output.

public GetAcceptorRule ( ) : TreeRule
Результат	TreeRule

public GetHashCode ( ) : int
Результат	int

Returns true iff all states that occur in the rule satisfy the predicate phi.

public IsTrueForAllStates ( bool>.Func phi ) : bool
phi	bool>.Func	predicate over states
Результат	bool

Include all states in the output also in the lookahead.

public Normalize ( ) : TreeRule
Результат	TreeRule

public ToString ( ) : string
Результат	string