Class SymbolTable

java.lang.Object

SymbolTable

public class SymbolTable
extends java.lang.Object

Created by garethhalladay on 10/23/17

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
(package private) class	SymbolTable.Symbol A class representing

Constructor Summary

Constructors

Constructor and Description
SymbolTable()

Method Summary

Modifier and Type	Method and Description
java.lang.Integer	get(java.lang.String k) Return the Integer associated with the variable name, k.
int	getSize()
java.util.List<SymbolTable.Symbol>	inorder()
static java.util.List<SymbolTable.Symbol>	inorderRecursive(SymbolTable.Symbol current, java.util.List<SymbolTable.Symbol> infix) Similar to the infixRecursive method you implemented in the previous assignment.
(package private) static boolean	isValidJavaIdentifier(java.lang.String k) Identifies whether or not the variable is a legal Java identifier.
static void	main(java.lang.String[] args)
void	put(java.lang.String k, java.lang.Integer v) If the variable is a legal Java identifier, add the symbol and it's corresponding value into the SymbolTree.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SymbolTable

public SymbolTable()

Method Detail

getSize

public int getSize()

isValidJavaIdentifier

static boolean isValidJavaIdentifier(java.lang.String k)

Identifies whether or not the variable is a legal Java identifier.

Read section 3.8 from the following resource to learn how to identify legal Java identifiers: Lexical Structure

This includes checking to make sure the identifier is not a keyword, boolean literal, or null literal.

Parameters:

k - the variable name

Returns:

true if variable is a legal Java identifier.

See Also:

Character.isJavaIdentifierStart(char), Character.isJavaIdentifierPart(char)

put

public void put(java.lang.String k,
                java.lang.Integer v)

If the variable is a legal Java identifier, add the symbol and it's corresponding value into the SymbolTree.

Here is the algorithm to add the symbol to the SymbolTree:

1. If the root is null, create a new Symbol and assign it to the root.
2. If the root is not null, create a temporary variable, current, and assign it to the root value.
3. If k is larger than the current node, check the right child, otherwise check the left child
4. While the child is not null:
   • If k is larger then current, assign current to its right child.
   • else assign current to its left child.
5. create a new Symbol and assign it the correct child.

Parameters:

k - the symbol name

v - the value to be associated with the symbol

Throws:

java.lang.RuntimeException - if k is not a valid Java identifier use the following message: String.format("\"%s\" is not a valid Java identifier", k)

get

public java.lang.Integer get(java.lang.String k)

Return the Integer associated with the variable name, k.
If the key is not a legal Java identifier, throw a RuntimeException with the message below.
If the key is not in the tree throw a RumTimeException with the message below.

Parameters:

k - the variable name

Returns:

the value associated with the variable

Throws:

java.lang.RuntimeException - if k is not a legal Java identifier, use the following message: String.format("\"%s\" is not a valid Java identifier", k)

java.lang.RuntimeException - if the variable does not exist, use the following message String.format("\"%s\" does not exist", k)

inorder

public java.util.List<SymbolTable.Symbol> inorder()

inorderRecursive

public static java.util.List<SymbolTable.Symbol> inorderRecursive(SymbolTable.Symbol current,
                                                                  java.util.List<SymbolTable.Symbol> infix)

Similar to the infixRecursive method you implemented in the previous assignment. For expressions this concept is identified as infix notation. The same concept for trees is identified as an inorder traversal.

Instead of creating a String, add the Symbol to the ArrayList.

1. Add the Symbol from the left subtree
2. Add the root Symbol
3. Add the Symbol from the right subtree

Parameters:

current - the current Symbol

infix - the ArrayList

Returns:

an ArrayList with Symbols in inorder traversal

main

public static void main(java.lang.String[] args)