1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
// [The "BSD licence"]
// Copyright (c) 2006-2007 Kay Roepke 2010 Alan Condit
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// 3. The name of the author may not be used to endorse or promote products
// derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#import <Cocoa/Cocoa.h>
#import "ANTLRCommonTree.h"
#import "ANTLRCommonTreeNodeStream.h"
#import "ANTLRLookaheadStream.h"
#import "ANTLRTreeNodeStream.h"
#import "ANTLRTreeIterator.h"
#import "ANTLRIntArray.h"
@interface ANTLRCommonTreeNodeStream : ANTLRLookaheadStream <ANTLRTreeNodeStream> {
#define DEFAULT_INITIAL_BUFFER_SIZE 100
#define INITIAL_CALL_STACK_SIZE 10
/** Pull nodes from which tree? */
__strong id root;
/** If this tree (root) was created from a token stream, track it. */
__strong id <ANTLRTokenStream> tokens;
/** What tree adaptor was used to build these trees */
__strong ANTLRCommonTreeAdaptor *adaptor;
/** The tree iterator we using */
__strong ANTLRTreeIterator *it;
/** Stack of indexes used for push/pop calls */
__strong ANTLRIntArray *calls;
/** Tree (nil A B C) trees like flat A B C streams */
BOOL hasNilRoot;
/** Tracks tree depth. Level=0 means we're at root node level. */
NSInteger level;
}
@property (retain, getter=getRoot, setter=setRoot:) ANTLRCommonTree *root;
@property (retain, getter=getTokens,setter=setTokens:) id<ANTLRTokenStream> tokens;
@property (retain, getter=getTreeAdaptor, setter=setTreeAdaptor:) ANTLRCommonTreeAdaptor *adaptor;
@property (assign, getter=getLevel, setter=setLevel:) NSInteger level;
+ (ANTLRCommonTreeNodeStream *) newANTLRCommonTreeNodeStream:(ANTLRCommonTree *)theTree;
+ (ANTLRCommonTreeNodeStream *) newANTLRCommonTreeNodeStream:(id<ANTLRTreeAdaptor>)anAdaptor Tree:(ANTLRCommonTree *)theTree;
- (id) initWithTree:(ANTLRCommonTree *)theTree;
- (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)adaptor Tree:(ANTLRCommonTree *)theTree;
- (void) reset;
/** Pull elements from tree iterator. Track tree level 0..max_level.
* If nil rooted tree, don't give initial nil and DOWN nor final UP.
*/
- (id) nextElement;
- (BOOL) isEOF:(id<ANTLRBaseTree>) obj;
- (void) setUniqueNavigationNodes:(BOOL) uniqueNavigationNodes;
- (id) getTreeSource;
- (NSString *) getSourceName;
- (id<ANTLRTokenStream>) getTokenStream;
- (void) setTokenStream:(id<ANTLRTokenStream>) tokens;
- (ANTLRCommonTreeAdaptor *) getTreeAdaptor;
- (void) setTreeAdaptor:(ANTLRCommonTreeAdaptor *) adaptor;
- (NSInteger) LA:(NSInteger) i;
/** Make stream jump to a new location, saving old location.
* Switch back with pop().
*/
- (ANTLRCommonTree *)getNode:(NSInteger) i;
- (void) push:(NSInteger) index;
/** Seek back to previous index saved during last push() call.
* Return top of stack (return index).
*/
- (NSInteger) pop;
// TREE REWRITE INTERFACE
- (void) replaceChildren:(id)parent From:(NSInteger)startChildIndex To:(NSInteger)stopChildIndex With:(id) t;
- (NSString *) toStringFromNode:(id<ANTLRBaseTree>)startNode ToNode:(id<ANTLRBaseTree>)stopNode;
/** For debugging; destructive: moves tree iterator to end. */
- (NSString *) toTokenTypeString;
@property (retain) ANTLRTreeIterator *it;
@property (retain) ANTLRIntArray *calls;
@property BOOL hasNilRoot;
@end
|
