Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Java: Symbol Table Visitor Implement ToDo Methods package AST.Visitor; import java.util.HashMap; import java.util.Iterator; import AST.*; import Symtab.*; public class SymTableVisitor implements Visitor { SymbolTable st

Java: Symbol Table Visitor

Implement ToDo Methods

package AST.Visitor;

import java.util.HashMap; import java.util.Iterator;

import AST.*; import Symtab.*;

public class SymTableVisitor implements Visitor {

SymbolTable st = new SymbolTable(); public void print() { st.print(0); } public String getTypeString(Type t) { /* TO DO */ return ""; } // MainClass m; // ClassDeclList cl; public void visit(Program n) { n.m.accept(this); for (int i = 0; i < n.cl.size(); i++) { n.cl.get(i).accept(this); } }

// Identifier i1,i2; // Statement s; public void visit(MainClass n) { /* TO DO */ }

// Identifier i; // VarDeclList vl; // MethodDeclList ml; public void visit(ClassDeclSimple n) { /* TO DO */ }

// Identifier i; // Identifier j; // VarDeclList vl; // MethodDeclList ml; public void visit(ClassDeclExtends n) { /* TO DO */ }

// Type t; // Identifier i; public void visit(VarDecl n) { /* TO DO */ }

// Type t; // Identifier i; // FormalList fl; // VarDeclList vl; // StatementList sl; // Exp e; public void visit(MethodDecl n) { /* TO DO */ }

// Type t; // Identifier i; public void visit(Formal n) { /* TO DO */ }

// StatementList sl; public void visit(Block n) { /* TO DO */ }

// Exp e; // Statement s1,s2; public void visit(If n) { /* TO DO */ }

// Exp e; // Statement s; public void visit(While n) { /* TO DO */ }

// Exp e; public void visit(Print n) { }

// Identifier i; // Exp e; public void visit(Assign n) { }

// Identifier i; // Exp e1,e2; public void visit(ArrayAssign n) { }

// Exp e1,e2; public void visit(And n) { }

// Exp e1,e2; public void visit(LessThan n) { }

// Exp e1,e2; public void visit(Plus n) { }

// Exp e1,e2; public void visit(Minus n) { }

// Exp e1,e2; public void visit(Times n) { }

// Exp e1,e2; public void visit(ArrayLookup n) { }

// Exp e; public void visit(ArrayLength n) { }

// Exp e; // Identifier i; // ExpList el; public void visit(Call n) { }

// int i; public void visit(IntegerLiteral n) { }

public void visit(True n) { }

public void visit(False n) { }

public void visit(This n) { }

// Exp e; public void visit(NewArray n) { }

// Identifier i = new Identifier(); public void visit(NewObject n) { }

// Exp e; public void visit(Not n) { }

// String s; public void visit(IdentifierExp n) { }

// String s; public void visit(Identifier n) { } // int[] i; public void visit(IntArrayType n) { }

// Bool b; public void visit(BooleanType n) { }

// Int i; public void visit(IntegerType n) { }

// String s; public void visit(IdentifierType n) { }

// Display added for toy example language. Not used in regular MiniJava public void visit(Display n) { } }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Building The Data Warehouse

Authors: W. H. Inmon

4th Edition

0764599445, 978-0764599446

More Books

Students also viewed these Databases questions