Grammatica 1.3 Documentation: RecursiveDescentParser.CallStack

Overview

Project

Class

Tree

Deprecated

Index

Grammatica 1.3 Documentation

FRAMES NO FRAMES

SUMMARY: INNER | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

PerCederberg.Grammatica.Parser
Class RecursiveDescentParser.CallStack

System.Object
   |
   +--RecursiveDescentParser.CallStack

A name value stack. This stack is used to detect loops and repetitions of the same production during look-ahead analysis.

Method Summary
`void`	`Clear()` Clears the stack.
`bool`	`Contains( string name )` Checks if the specified name is on the stack.
`bool`	`Contains( string name, int value )` Checks if the specified name and value combination is on the stack.
`void`	`Pop()` Removes the top element of the stack.
`void`	`Push( string name, int value )` Adds a new element to the top of the stack.

Method Detail

public void Clear();

Clears the stack. This method removes all elements on the stack.

public bool Contains( string name );

public bool Contains( string name, int value );

public void Pop();

Removes the top element of the stack.

public void Push( string name, int value );