Lines Matching refs:Pattern
926 /// patterns like "(A B C)". You can create a tree from that pattern or
958 /// <summary>Return a List of subtrees matching pattern</summary>
959 function Find(const T: IANTLRInterface; const Pattern: String): IList<IANTLRInterface>; overload;
962 function FindFirst(const T: IANTLRInterface; const Pattern: String): IANTLRInterface; overload;
969 /// version of the general visit(t, pattern) method. The labels arg
971 /// a token type rather than a pattern doesn't let us set a label.
977 /// For all subtrees that match the pattern, execute the visit action.
980 /// The implementation uses the root node of the pattern in combination
984 procedure Visit(const T: IANTLRInterface; const Pattern: String;
988 /// Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels
990 /// return true if the pattern matches and fill the labels Map with
992 /// the pattern is malformed or the tree does not match.
995 /// If a node specifies a text arg in pattern, then that must match
998 /// TODO: what's a better way to indicate bad pattern? Exceptions are a hassle
1000 function Parse(const T: IANTLRInterface; const Pattern: String;
1002 function Parse(const T: IANTLRInterface; const Pattern: String): Boolean; overload;
1005 /// Create a tree or node from the indicated tree pattern that closely
1020 function CreateTreeOrNode(const Pattern: String): IANTLRInterface;
1046 function Pattern: IANTLRInterface;
1667 /// <summary>The tree pattern to lex like "(A B C)"</summary>
1676 /// <summary>How long is the pattern in char?</summary>
1805 function Find(const T: IANTLRInterface; const Pattern: String): IList<IANTLRInterface>; overload;
1807 function FindFirst(const T: IANTLRInterface; const Pattern: String): IANTLRInterface; overload;
1810 procedure Visit(const T: IANTLRInterface; const Pattern: String;
1812 function Parse(const T: IANTLRInterface; const Pattern: String;
1814 function Parse(const T: IANTLRInterface; const Pattern: String): Boolean; overload;
1815 function CreateTreeOrNode(const Pattern: String): IANTLRInterface;
1850 function Pattern: IANTLRInterface;
4010 function TTreeWizard.CreateTreeOrNode(const Pattern: String): IANTLRInterface;
4015 Tokenizer := TTreePatternLexer.Create(Pattern);
4017 Result := Parser.Pattern;
4032 const Pattern: String): IList<IANTLRInterface>;
4042 // Create a TreePattern from the pattern
4043 Tokenizer := TTreePatternLexer.Create(Pattern);
4045 TreePattern := Parser.Pattern as ITreePattern;
4072 const Pattern: String): IANTLRInterface;
4093 const Pattern: String): Boolean;
4095 Result := Parse(T, Pattern, nil);
4098 function TTreeWizard.Parse(const T: IANTLRInterface; const Pattern: String;
4105 Tokenizer := TTreePatternLexer.Create(Pattern);
4107 TreePattern := Parser.Pattern as ITreePattern;
4111 procedure TTreeWizard.Visit(const T: IANTLRInterface; const Pattern: String;
4120 // Create a TreePattern from the pattern
4121 Tokenizer := TTreePatternLexer.Create(Pattern);
4123 TreePattern := Parser.Pattern as ITreePattern;
4208 // map label in pattern to node in t1
4369 function TTreePatternParser.Pattern: IANTLRInterface;
