Lines Matching full:nil
37 ANTLRTreeNavigationNodeDown *navigationNodeDown = nil;
38 ANTLRTreeNavigationNodeUp *navigationNodeUp = nil;
39 ANTLRTreeNavigationNodeEOF *navigationNodeEOF = nil;
44 static id<ANTLRBaseTree> invalidNode = nil;
50 if ( invalidNode == nil ) {
58 if ( invalidNode == nil ) {
81 if ( self != nil ) {
82 children = nil;
85 return nil;
91 if ( self != nil ) {
97 return nil;
111 if ( children == nil || i >= [children count] ) {
112 return nil;
136 for (NSUInteger i = 0; children != nil && i < [children count]; i++) {
142 return nil;
147 if ( children == nil ) {
163 if ( t == nil ) {
164 return; // do nothing upon addChild(nil)
170 if ( children != nil && children == childTree.children ) {
174 if ( childTree.children != nil ) {
175 if ( children != nil ) { // must copy, this has children already
180 // handle double-link stuff for each child of nil root
193 else { // child is not nil (don't care about children)
194 if ( children == nil ) {
215 if ( t == nil ) {
221 if ( children == nil ) {
236 if ( children == nil ) {
237 return nil;
247 * a list (nil-root ANTLRTree). num of children can increase or decrease.
258 if ( children == nil ) {
264 AMutableArray *newChildren = nil;
342 [self sanityCheckParentAndChildIndexes:nil At:-1];
386 return nil;
403 return nil;
413 return([self getAncestor:ttype] != nil);
421 while ( t != nil ) {
426 return nil;
434 if ( [self getParent] == nil )
435 return nil;
439 while ( t != nil ) {
453 return nil;
502 if ( children == nil || [children count] == 0 ) {
511 for (int i = 0; children != nil && i < [children count]; i++) {
532 return nil;
538 return nil;
557 return nil;
564 if ( navigationNodeDown == nil )
582 if ( navigationNodeUp == nil )
601 if ( navigationNodeEOF == nil )
