--- parser3/src/include/pa_stack.h	2001/02/21 17:36:30	1.1
+++ parser3/src/include/pa_stack.h	2001/03/19 15:29:38	1.7
@@ -1,5 +1,9 @@
-/*
-  $Id: pa_stack.h,v 1.1 2001/02/21 17:36:30 paf Exp $
+/** @file
+	Parser
+	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
+	Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
+
+	$Id: pa_stack.h,v 1.7 2001/03/19 15:29:38 paf Exp $
 */
 
 #ifndef PA_STACK_H
@@ -7,31 +11,31 @@
 
 #include "pa_array.h"
 
+/// simple stack based on Array
 class Stack : public Array {
 public:
 
-	Stack(Pool& apool) : Array(apool), top(0) {
+	Stack(Pool& apool) : Array(apool), ftop(0) {
 	}
 
 	void push(Item *item) {
-		if(top<size()) // cell is already allocated?
-			put(top, item); // use it
+		if(ftop<size()) // cell is already allocated?
+			put(ftop, item); // use it
 		else
 			*this+=item; // append it
-		top++;
+		ftop++;
 	}
 	Item *pop() {
-		return get(--top);
+		return get(--ftop);
 	}
 
-	Item *operator [] (int top_offset) {
-		return get(top-top_offset-1);
-	}
+	int top_index() { return ftop-1; }
+	Item *top_value() { return get(top_index()); }
 
 private:
 
 	// deepest used index
-	int top;
+	int ftop;
 
 };