Lines Matching refs:STOP
92 /// input symbol at which the error was detected. The stop token indicates
105 function ErrorNode(const Input: ITokenStream; const Start, Stop: IToken;
168 /// as the setting of start/stop indexes relies on a single non-nil root
172 /// unless there is only one ID. For a list, the start/stop indexes
270 /// That node would contain the start/stop indexes then.
281 /// Get the token stop index for this subtree; return -1 if no such index
320 /// Replace from start to stop child index of parent with t, which might
363 /// <summary>Return the text of all nodes from start to stop, inclusive.
365 /// walk recursively from start until stop. You can always return
369 function ToString(const Start, Stop: IANTLRInterface): String; overload;
375 /// Replace from start to stop child index of parent with t, which might
476 /// Delete children from start to stop and replace with t even if t is
750 function ToTokenString(const Start, Stop: Integer): String;
751 function ToString(const Start, Stop: IANTLRInterface): String; overload;
1274 function ErrorNode(const Input: ITokenStream; const Start, Stop: IToken;
1415 function ToString(const Start, Stop: IANTLRInterface): String; reintroduce; overload;
1430 function ToTokenString(const Start, Stop: Integer): String;
1660 STOP = 2;
2044 function ToString(const Start, Stop: IANTLRInterface): String; reintroduce; overload; virtual;
2085 procedure ToStringWork(const P, Stop: IANTLRInterface;
2621 // in follow set). So, stop will be 1 to left to start. adjust.
2792 Stop: IToken; const E: ERecognitionException): IANTLRInterface;
2794 Result := TCommonErrorNode.Create(Input, Start, Stop, E);
3000 Start, Stop: Integer;
3010 Stop := StopToken.TokenIndex
3012 Stop := 0;
3015 (T as ITree).TokenStopIndex := Stop;
3286 Stop: IANTLRInterface): String;
3295 if (Start = nil) or (Stop = nil) then
3305 if Supports(Stop, ICommonTree, CommonTree) then
3308 WriteLn(Stop.ToString);
3314 EndTokenIndex := FAdaptor.GetTokenStartIndex(Stop);
3315 // if it's a tree, use start/stop index from start node
3316 // else use token range from start/stop nodes
3317 if (FAdaptor.GetNodeType(Stop) = TToken.UP) then
3320 if (FAdaptor.GetNodeType(Stop) = TToken.EOF) then
3337 // now walk until we see stop, filling string buffer with text
3341 while (T <> Stop) do
3351 // include stop node too
3352 Text := FAdaptor.GetNodeText(Stop);
3354 Text := ' ' + IntToStr(FAdaptor.GetNodeType(Stop));
3383 Stop: Integer): String;
3393 for I := Stop to Min(FNodes.Count - 1, Stop) do
3919 Exit(STOP);
4360 if (FTokenType <> TTreePatternLexer.STOP) then
4859 procedure TUnBufferedTreeNodeStream.ToStringWork(const P, Stop: IANTLRInterface;
4873 if SameObj(P, Stop) then
4884 ToStringWork(FAdaptor.GetChild(P, C), Stop, Buf);
4933 Stop: IANTLRInterface): String;
4944 // don't trust stop node as it's often an UP node etc...
4948 if (Stop <> nil) and (FAdaptor.GetNodeType(Stop) = TToken.UP) then
4957 ToStringWork(Start, Stop, Buf);
