You must consider what data structures and algorithms are required in your Postfix$++$ interpreter.

Phase $1$: Design

Tokens Stack before Action Stack after

A $3=[]$ Read A $[$A$]$

$3=[$A$]$ Read $3[3$ A$]$

$=[3$ A$]$ Pop twice and set the

value of A to $3$

$[]$

Example Key Value

Phone book Name Telephone number

DNS URL IP address

Education Student ID Module grades

Compiler Variable name Memory address

Dictionary Word Definition

Consider first your choice of data structures. Why are they appropriate? How will they be

implemented? Make a list of the data structures and alongside each structure write a few words

of justification.

Then consider the major algorithms. There be will algorithms to access and modify the symbol

table, and an algorithm to perform postfix arithmetic. Your report will contain pseudocode for

each algorithm.