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
121
122
123
124
125
126
|
//
// ANTLRSymbolStack.m
// ANTLR
//
// Created by Alan Condit on 6/9/10.
// [The "BSD licence"]
// Copyright (c) 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.
#define SUCCESS (0)
#define FAILURE (-1)
#import "ANTLRSymbolStack.h"
#import "ANTLRTree.h"
@implementation ANTLRSymbolsScope
+ (ANTLRSymbolsScope *)newANTLRSymbolsScope
{
return( [[ANTLRSymbolsScope alloc] init] );
}
- (id)init
{
if ((self = [super init]) != nil) {
}
return (self);
}
@end
/*
* Start of ANTLRSymbolStack
*/
@implementation ANTLRSymbolStack
+(ANTLRSymbolStack *)newANTLRSymbolStack
{
return [[ANTLRSymbolStack alloc] initWithLen:30];
}
+(ANTLRSymbolStack *)newANTLRSymbolStackWithLen:(NSInteger)cnt
{
return [[ANTLRSymbolStack alloc] initWithLen:cnt];
}
-(id)init
{
if ((self = [super init]) != nil) {
}
return( self );
}
-(id)initWithLen:(NSInteger)cnt
{
if ((self = [super initWithLen:cnt]) != nil) {
}
return( self );
}
-(void)dealloc
{
#ifdef DEBUG_DEALLOC
NSLog( @"called dealloc in ANTLRSymbolStack" );
#endif
[super dealloc];
}
- (id) copyWithZone:(NSZone *)aZone
{
return [super copyWithZone:aZone];
}
-(ANTLRSymbolsScope *)getHashMapEntry:(NSInteger)idx
{
return( (ANTLRSymbolsScope *)[super objectAtIndex:idx] );
}
-(ANTLRSymbolsScope **)getHashMap
{
return( (ANTLRSymbolsScope **)ptrBuffer );
}
-(ANTLRSymbolsScope *) pop
{
return (ANTLRSymbolsScope *)[super pop];
}
- (void) insertObject:(ANTLRSymbolsScope *)aRule atIndex:(NSInteger)idx
{
if ( aRule != ptrBuffer[idx] ) {
if ( ptrBuffer[idx] ) [ptrBuffer[idx] release];
[aRule retain];
}
ptrBuffer[idx] = aRule;
}
- (ANTLRSymbolsScope *)objectAtIndex:(NSInteger)idx
{
return (ANTLRSymbolsScope *)[super objectAtIndex:idx];
}
@end
|
