Lecture Objectives To understand how Java implements a stack To learn how to implement a stack using an underlying array or linked list Implement.

Lecture Objectives To understand how Java implements a

stack To learn how to implement a stack using

an underlying array or linked list Implement a simple calculator

2 Implementing a Stack

Click icon to add picture

Implementing a Stack as an Extension of Vector

Part of the package java.util :public class Stack<E> extends Vector<E>

Vector: a growable array of objects

Implementing a Stack as an Extension of Vector (cont.)

We can use Vector's add method to implement push:public E push(obj E) { add(obj); return obj;}

pop can be coded aspublic E throws EmptyStackException { try {return remove (size() – 1); } catch (ArrayIndexOutOfBoundsException ex) {throw new EmptyStackException(); }}

Implementing a Stack as an Extension of Vector (cont.)

All of Vector operations can be applied to a Stack Such as searches and access by index

This violates the principle of information hiding

A little about information hiding Principle:

Hide internal details of a component from other components

Why? Prevent damage from wrong external code Make components easier to understand/use Simplify modification and repair Facilitate re-use

Implementing a Stack with a List Component

ListStack: has a List component We can use ArrayList, Vector, or the LinkedList

classes to implement the List interface. push method:

public E push(E obj) { theData.add(obj); return obj;}

Adapter class: stack in this case is adapter class of List

Method delegation: from stack to list

Implementing a Stack with a List Component (cont.)

public class ListStack<E> implements Stack<E>{ private List<E> theData; public ListStack( ) { theData = new ArrayList<E>(); } @Override public E push( E obj ) { theData.add(obj);

return obj; }CS340

Implementing a Stack with a List Component (cont.)

@Override public E pop( ) { if( empty( ) ) throw new EmptyStackException( "ListStack pop" ); return theData.remove(theData.size()-1); } @Override public E peek( ) { if( empty( ) ) throw new EmptyStackException( "ListStack top" ); return theData.get(theData.size()-1); }

Implementing a Stack with a List Component (cont.)@Override public boolean empty( ) { return(theData.size() == 0); }

Implementing a Stack Using an Array

If we implement a stack as an array, we would need . . .

public class ArrayStack<E> implements StackInt<E> { private E[] theData; int topOfStack = -1; private static final int INITIAL_CAPACITY = 10;

@SupressWarnings("unchecked") public ArrayStack() { theData = (E[])new Object[INITIAL_CAPACITY]; }

Allocate storage for an array with a default

capacity

Keep track of the top of the stack

We do not need a size variable or method

Implementing a Stack Using an Array (cont.)

ArrayStack

theData = topOfStack = -1

Object[]

[0] = null[1] = null[2] = null[3] = null[4] = null[5] = null[6] = null[7] = null[8] = null[9] = null

public E push(E obj) { if (topOfStack == theData.length - 1){ reallocate(); } topOfStack++; theData[topOfStack] = obj; return obj;}

Character

value = 'J'

Character

value = 'a'

Character

value = 'v'

Character

value = 'a'

Implementing a Stack Using an Array (cont.)

@Overridepublic E pop() { if (empty()) { throw new EmptyStackException(); } return theData[topOfStack--];}

This implementation is O(1)

Implementing a Stack as a Linked Data Structure

We can also implement a stack using a linked list of nodes

It is easiest to insert and delete from the

head of a list

push inserts a node at the head and pop

deletes the node at the head

when the list is empty, pop returns null

Implementing a Stack as a Linked Data Structure (cont.)

public class LinkedStack<E> implements Stack<E>{// Data fieldsPrivate Node<E> topOfStackRef = null;// Methods: push, pop, peek, empty

Comparison of Stack Implementations

Extending a Vector: poor choice for stack implementation

The easiest implementation uses a List component (ArrayList is the simplest) for storing data Array requires reallocation of space when the

array becomes full, and Linked data structure requires allocating

storage for links All insertions and deletions occur at one

end: constant time, O(1)

17 Additional Stack Applications

Click icon to add picture

Additional Stack Applications

Postfix and infix notation Expressions normally are written in infix form, but it easier to evaluate an expression in postfix form

since there is no need to group sub-expressions in parentheses or worry about operator precedence

Evaluating Postfix Expressions

Write a class that evaluates a postfix expression

Use the space character as a delimiter between tokens

Evaluating Postfix Expressions (cont.)

1. create an empty stack of integers 2. while there are more tokens 3. get the next token 4. if the first character of the token is a digit 5. push the character on the stack 6. else if the token is an operator 7. pop the right operand off the stack 8. pop the left operand off the stack 9. evaluate the operation10. push the result onto the stack11. pop the stack and return the result

7 -20*4

7 -20*44 77

7 -20*44 72828

7 -20*44 728

7 -20*44 720

28 - 20

7 -20*44 788

1. create an empty stack of integers 2. while there are more tokens 3. get the next token 4. if the first character of the token is a digit 5. push the number on the stack 6. else if the token is an operator 7. pop the right operand off the stack 8. pop the left operand off the stack 9. evaluate the operation10. push the result onto the stack11. pop the stack and return the result

7 -20*44 78

Listing 3.6 (PostfixEvaluator.java, pages 173 - 175)

Testing: write a driver which creates a PostfixEvaluator object reads one or more expressions and report the result catches PostfixEvaluator.SyntaxErrorException exercises each path by using each operator exercises each path through the method by trying

different orderings and multiple occurrences of operators tests for syntax errors:

an operator without any operands a single operand an extra operand an extra operator a variable name the empty string

Lecture Objectives To understand how Java implements a stack To learn how to implement a stack using an underlying array or linked list Implement.

Documents

How to Use Short Stack

How to implement OpenDaylight application ?

How to Implement MapReduce

How to Implement AgileQA

How to Implement Practice Management

How to implement Slack

How to Implement Leak

How to Implement an EHR

How to Implement ISFs

Stack rack how they help

HOW DO COMPANIES STACK UP?

How organizations implement accessibility

How to Implement Meaningful Sustainability

How to Implement Proceess Accounting

How to implement 5 s

How to Implement a ROWE