Lines Matching refs:summary
57 /// <summary>
60 /// </summary>
67 /// <summary>
69 /// </summary>
72 /// <summary>
76 /// </summary>
80 /// <summary>Tell the stream to start buffering if it hasn't already.</summary>
92 /// <summary>
96 /// </summary>
99 /// <summary>
102 /// </summary>
114 /// <summary>
116 /// </summary>
127 /// <summary>
133 /// </summary>
141 /// <summary>
144 /// </summary>
168 /// <summary>Returns the size of the entire stream.</summary>
178 /// <summary>
182 /// </summary>
186 /// <summary>A source of characters for an ANTLR lexer </summary>
197 /// <summary>
202 /// </summary>
205 /// <summary>
209 /// </summary>
214 /// <summary>
218 /// </summary>
221 /// <summary>
225 /// </summary>
248 /// <summary>The line number on which this token was matched; line=1..N</summary>
251 /// <summary>
253 /// </summary>
256 /// <summary>The line number on which this token was matched; line=1..N</summary>
259 /// <summary>
261 /// </summary>
267 /// <summary>The text of the token</summary>
275 /// <summary>
288 /// </summary>
296 /// <summary>
301 /// </summary>
306 /// <summary>
309 /// </summary>
313 /// <summary>A stream of tokens accessing tokens from a TokenSource </summary>
322 /// <summary>
329 /// </summary>
332 /// <summary>
339 /// </summary>
342 /// <summary>Return the text of all tokens from start to stop, inclusive.
346 /// </summary>
349 /// <summary>Because the user is not required to use a token with an index stored
354 /// </summary>
361 /// <summary>
367 /// </summary>
379 /// <summary>Index into the char stream of next lookahead char </summary>
382 /// <summary>What line number is the scanner at before processing buffer[P]? </summary>
385 /// <summary>What char position 0..N-1 in line is scanner before processing buffer[P]? </summary>
389 /// <summary>
392 /// </summary>
397 /// <summary>
401 /// </summary>
406 /// <summary>
410 /// </summary>
420 /// <summary>
423 /// </summary>
429 /// <summary>
433 /// </summary>
441 /// <summary>return "this or a" in a new set </summary>
444 /// <summary>Or this element into this set (grow as necessary to accommodate)</summary>
447 /// <summary> Grows the set to a larger number of bits.</summary>
461 /// <summary>return how much space is being used by the bits array not
463 /// </summary>
478 /// <summary>
481 /// </summary>
525 /// <summary>
529 /// </summary>
533 /// <summary>
537 /// </summary>
540 /// <summary>
542 /// </summary>
551 /// <summary>
554 /// </summary>
557 /// <summary>
559 /// </summary>
562 /// <summary>
565 /// </summary>
568 /// <summary>
571 /// </summary>
586 /// <summary>
588 /// </summary>
600 /// <summary>
602 /// </summary>
609 /// <summary>
611 /// </summary>
614 /// <summary>The character position of first character within the line</summary>
617 /// <summary>The channel number for the current token</summary>
620 /// <summary>The token type for the current token</summary>
623 /// <summary>
626 /// </summary>
649 /// <summary>
656 /// </summary>
684 /// <summary>
689 /// </summary>
705 /// <summary>Reset the parser's state. Subclasses must rewind the input stream.</summary>
708 /// <summary>
712 /// </summary>
730 /// <summary>A hook to listen in on the token consumption during error recovery.
732 /// </summary>
736 /// <summary>
738 /// </summary>
755 /// <summary> Match the wildcard: in a symbol</summary>
761 /// <summary>
779 /// </summary>
783 /// <summary>
785 /// </summary>
788 /// <summary>
796 /// </summary>
799 /// <summary>
801 /// </summary>
804 /// <summary>
810 /// </summary>
819 /// <summary>Consume tokens until one matches the given token set </summary>
822 /// <summary>
827 /// </summary>
835 /// <summary>
842 /// </summary>
849 /// <summary>A convenience method for use most often with template rewrites.
851 /// </summary>
854 /// <summary>
860 /// </summary>
868 /// <summary>
877 /// </summary>
881 /// <summary>
884 /// </summary>
888 /// <summary>
891 /// </summary>
905 /// <summary>
912 /// </summary>
915 /// <summary>
918 /// </summary>
922 /// <summary>
925 /// </summary>
929 /// <summary>
933 /// </summary>
937 /// <summary>
944 /// </summary>
948 /// <summary>
951 /// </summary>
968 /// <summary>Given a start and stop index, return a List of all tokens in
971 /// </summary>
989 /// <summary>
991 /// </summary>
1015 /// <summary>
1018 /// </summary>
1023 /// <summary>
1025 /// </summary>
1039 /// <summary>
1044 /// </summary>
1058 /// <summary>
1060 /// </summary>
1063 /// <summary>
1068 /// </summary>
1071 /// <summary>This is the lexer entry point that sets instance var 'token' </summary>
1074 /// <summary>
1079 /// </summary>
1082 /// <summary>
1087 /// </summary>
1099 /// <summary>
1104 /// </summary>
1114 /// <summary>Set the char stream and reset the lexer </summary>
1119 /// <summary>What is the index of the current character of lookahead? </summary>
1122 /// <summary>
1124 /// </summary>
1138 /// <summary>A parser for TokenStreams. Parser grammars result in a subclass
1140 /// </summary>
1153 /// <summary>Set the token stream and reset the parser </summary>
1157 /// <summary>
1159 /// </summary>
1173 /// <summary>Return the start token or tree </summary>
1176 /// <summary>Return the stop token or tree </summary>
1179 /// <summary>Has a value potentially if output=AST; </summary>
1182 /// <summary>
1185 /// </summary>
1189 /// <summary>
1206 /// </summary>
1211 /// <summary>Useful for dumping out the input stream after doing some
1213 /// </summary>
1275 /// <summary>Rollback the instruction stream for a program so that
1278 /// </summary>
1284 /// <summary>Reset the program so that no instructions exist </summary>
1350 /// <summary>The root of the ANTLR exception hierarchy.</summary>
1383 /// <summary>What input stream did the error occur in? </summary>
1386 /// <summary>
1388 /// </summary>
1391 /// <summary>
1394 /// </summary>
1397 /// <summary>[Tree parser] Node with the problem.</summary>
1400 /// <summary>The current char when an error occurred. For lexers. </summary>
1403 /// <summary>Track the line at which the error occurred in case this is
1406 /// </summary>
1413 /// <summary>Used for remote debugger deserialization </summary>
1419 /// <summary>
1424 /// </summary>
1427 /// <summary>
1430 /// </summary>
1433 /// <summary>
1435 /// </summary>
1438 /// <summary>
1440 /// </summary>
1443 /// <summary>
1446 /// </summary>
1449 /// <summary>Returns the input stream in which the error occurred</summary>
1452 /// <summary>
1454 /// </summary>
1457 /// <summary>
1459 /// </summary>
1462 /// <summary>
1464 /// </summary>
1468 /// <summary>
1470 /// </summary>
1491 /// <summary>
1494 /// </summary>
1611 /// <summary>How many characters are actually in the buffer?</summary>
1614 /// <summary>Current line number within the input (1..n )</summary>
1617 /// <summary>Index in our array for the next char (0..n-1)</summary>
1620 /// <summary>
1623 /// </summary>
1626 /// <summary>
1628 /// </summary>
1631 /// <summary>
1636 /// </summary>
1639 /// <summary>
1641 /// </summary>
1643 /// <summary>
1645 /// </summary>
1677 /// <summary>
1681 /// </summary>
1684 /// <summary>
1688 /// </summary>
1697 /// <summary>Fully qualified name of the stream's underlying file</summary>
1707 /// <summary>
1710 /// </summary>
1713 /// <summary>
1716 /// </summary>
1726 ///<summary> We will often need to do a mod operator (i mod nbits).
1730 /// </summary>
1733 /// <summary>The actual data bits </summary>
1758 /// <summary>Construct a bitset of size one word (64 bits) </summary>
1761 /// <summary>Construction from a static array of ulongs </summary>
1764 /// <summary>Construction from a list of integers </summary>
1767 /// <summary>Construct a bitset given the size</summary>
1842 /// <summary>We need to be able to change the text once in a while. If
1845 /// </summary>
1848 /// <summary>What token number is this from 0..n-1 tokens; < 0 implies invalid index </summary>
1851 /// <summary>The char position into the input buffer where this token starts </summary>
1854 /// <summary>The char position into the input buffer where this token stops </summary>
1898 /// <summary>What token number is this from 0..n-1 tokens </summary>
1931 /// <summary>imaginary tree navigation type; traverse "get child" link </summary>
1934 /// <summary>imaginary tree navigation type; finish with a child list </summary>
1941 /// <summary>
1945 /// </summary>
1948 /// <summary>
1950 /// </summary>
1956 /// <summary>
1959 /// </summary>
1965 /// <summary>
1967 /// </summary>
1990 /// <summary>
1993 /// </summary>
2005 /// <summary>
2012 /// </summary>
2016 /// <summary>
2022 /// </summary>
2026 /// <summary>
2028 /// </summary>
2060 /// <summary>
2062 /// </summary>
2085 /// <summary>
2087 /// </summary>
2091 /// <summary>Compute the context-sensitive FOLLOW set for current rule.
2142 /// </summary>
2300 /// <summary>Record every single token pulled from the source so we can reproduce
2302 /// </summary>
2305 /// <summary><![CDATA[Map<tokentype, channel>]]> to override some Tokens' channel numbers </summary>
2308 /// <summary><![CDATA[Set<tokentype>;]]> discard any tokens with this type </summary>
2311 /// <summary>Skip tokens on any channel but this one; this is how we skip whitespace... </summary>
2314 /// <summary>By default, track all incoming tokens </summary>
2317 /// <summary>Track the last Mark() call result value for use in Rewind().</summary>
2320 /// <summary>
2323 /// </summary>
2326 /// <summary>Load all tokens from the token source and put in tokens.
2329 /// </summary>
2332 /// <summary>Look backwards k tokens on-channel tokens </summary>
2335 /// <summary>Given a starting index, return the index of the first on-channel
2337 /// </summary>
2438 /// <summary>Where is the lexer drawing characters from? </summary>
2556 /// <summary>Execute the rewrite operation by possibly adding to the buffer.
2558 /// </summary>
2609 /// <summary>I'm going to try replacing range from x..y with (y-x)+1 ReplaceOp
2611 /// </summary>
2654 /// <summary>You may have multiple, named streams of rewrite operations.
2657 /// </summary>
2660 /// <summary>Map String (program name) -> Integer index </summary>
2743 /// <summary>
2745 /// </summary>
2794 /// <summary>
2796 /// </summary>
