blob: 909192f020b5b9388474b81ffa0f49b999568298 [file] [log] [blame]
//
// ANTLRRuleStack.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 "ANTLRRuleStack.h"
#import "ANTLRTree.h"
/*
* Start of ANTLRRuleStack
*/
@implementation ANTLRRuleStack
+ (ANTLRRuleStack *)newANTLRRuleStack
{
return [[ANTLRRuleStack alloc] init];
}
+ (ANTLRRuleStack *)newANTLRRuleStack:(NSInteger)cnt
{
return [[ANTLRRuleStack 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
{
[super dealloc];
}
- (id) copyWithZone:(NSZone *)aZone
{
return [super copyWithZone:aZone];
}
- (NSInteger)count
{
ANTLRRuleMemo *anElement;
NSInteger aCnt = 0;
for( int i = 0; i < BuffSize; i++ ) {
if ((anElement = ptrBuffer[i]) != nil)
aCnt++;
}
return aCnt;
}
- (NSInteger)size
{
ANTLRRuleMemo *anElement;
NSInteger aSize = 0;
for( int i = 0; i < BuffSize; i++ ) {
if ((anElement = ptrBuffer[i]) != nil) {
aSize++;
}
}
return aSize;
}
- (ANTLRHashRule *)pop
{
return (ANTLRHashRule *)[super pop];
}
- (void) insertObject:(ANTLRHashRule *)aRule atIndex:(NSInteger)idx
{
if ( idx >= BuffSize ) {
NSLog( @"In ANTLRRuleStack attempting to insert aRule at Index %d, but Buffer is only %d long\n", idx, BuffSize );
[self ensureCapacity:idx];
}
if ( aRule != ptrBuffer[idx] ) {
if (ptrBuffer[idx] != nil) [ptrBuffer[idx] release];
[aRule retain];
}
ptrBuffer[idx] = aRule;
}
- (ANTLRHashRule *)objectAtIndex:(NSInteger)idx
{
if (idx < BuffSize) {
return ptrBuffer[idx];
}
return nil;
}
- (void)putHashRuleAtRuleIndex:(NSInteger)aRuleIndex StartIndex:(NSInteger)aStartIndex StopIndex:(NSInteger)aStopIndex
{
ANTLRHashRule *aHashRule;
ANTLRRuleMemo *aRuleMemo;
if (aRuleIndex >= BuffSize) {
NSLog( @"putHashRuleAtRuleIndex attempting to insert aRule at Index %d, but Buffer is only %d long\n", aRuleIndex, BuffSize );
[self ensureCapacity:aRuleIndex];
}
if ((aHashRule = ptrBuffer[aRuleIndex]) == nil) {
aHashRule = [[ANTLRHashRule newANTLRHashRuleWithLen:17] retain];
ptrBuffer[aRuleIndex] = aHashRule;
}
if (( aRuleMemo = [aHashRule objectAtIndex:aStartIndex] ) == nil ) {
aRuleMemo = [[ANTLRRuleMemo newANTLRRuleMemo] retain];
[aHashRule insertObject:aRuleMemo atIndex:aStartIndex];
}
[aRuleMemo setStartIndex:[NSNumber numberWithInteger:aStartIndex]];
[aRuleMemo setStopIndex:[NSNumber numberWithInteger:aStopIndex]];
}
@end