def test_symbol_table_builder():
text = """
PROGRAM Part11;
VAR
x : INTEGER;
y : REAL;
BEGIN
END.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
builtins_scope = semantic_analyzer.visit(tree)
assert builtins_scope._symbols == {
"INTEGER": integer_type,
"REAL": real_type,
"PART11": ProcedureSymbol("PART11"),
}
assert builtins_scope.global_scope._symbols == {
"X": VarSymbol("X", integer_type),
"Y": VarSymbol("Y", real_type),
}
def test_case_insensitive():
text = r"""
program hello_world;
VAR
_num_ber, a, b, c: INTEGER;
x: integer;
BEGIN
BEgIN
_num_ber := 2;
a := _Num_Ber;
B := 10 * a + 10 * _NUM_BER div 4;
c := a - - b
enD;
{ this is a comment }
x := 11
END.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
SemanticAnalyzer().visit(tree)
interpreter = Interpreter(tree)
interpreter.interpret()
assert interpreter.GLOBAL_SCOPE == {
"A": 2,
"X": 11,
"C": 27,
"B": 25,
"_NUM_BER": 2,
}
def infix2postfix(s):
lexer = Lexer(s)
parser = Parser(lexer)
tree = parser.parse()
translator = Infix2PostfixTranslator(tree)
translation = translator.translate()
return translation
def test_interpreter():
text = r"""
PROGRAM HELLO_WORLD;
VAR
number, a, b, c: INTEGER;
x: REAL;
BEGIN
BEGIN
number := 2;
a := number; { this is a comment }
b := 10 * a + 10 * number DIV 4;
c := a - - b
END;
x := 11.2;
END.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
SemanticAnalyzer().visit(tree)
interpreter = Interpreter(tree)
interpreter.interpret()
assert interpreter.GLOBAL_SCOPE == {
"A": 2,
"X": 11.2,
"C": 27,
"B": 25,
"NUMBER": 2,
}
def infix2lisp(s):
lexer = Lexer(s)
parser = Parser(lexer)
tree = parser.parse()
translator = Infix2LispTranslator(tree)
translation = translator.translate()
return translation
def test_part12():
text = """
PROGRAM Part12;
VAR
a : INTEGER;
PROCEDURE P1;
VAR
a : REAL;
k : INTEGER;
PROCEDURE P2;
VAR
a, z : INTEGER;
BEGIN {P2}
z := 777;
END; {P2}
BEGIN {P1}
END; {P1}
BEGIN {Part12}
a := 10;
END. {Part12}
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
builtins_scope = semantic_analyzer.visit(tree)
global_scope = builtins_scope.global_scope
interpreter = Interpreter(tree)
interpreter.interpret()
assert builtins_scope._symbols == {
"INTEGER": integer_type,
"REAL": real_type,
"PART12": ProcedureSymbol("PART12"),
}
assert global_scope._symbols == {
"A": VarSymbol("A", integer_type),
"P1": ProcedureSymbol("P1"),
}
assert global_scope.P1_scope._symbols == {
"A": VarSymbol("A", real_type),
"K": VarSymbol("K", integer_type),
"P2": ProcedureSymbol("P2"),
}
assert global_scope.P1_scope.P2_scope._symbols == {
"A": VarSymbol("A", integer_type),
"Z": VarSymbol("Z", integer_type),
}
assert interpreter.GLOBAL_SCOPE == {"A": 10}
def runSemanticAnalyzer(self, text):
from spi import Lexer, Parser, SemanticAnalyzer
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
semantic_analyzer.visit(tree)
return semantic_analyzer
def makeInterpreter(self, text):
from spi import Lexer, Parser, SymbolTableBuilder, Interpreter
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
symtab_builder = SymbolTableBuilder()
symtab_builder.visit(tree)
interpreter = Interpreter(tree)
return interpreter
def makeInterpreter(self, text):
from spi import Lexer, Parser, SemanticAnalyzer, Interpreter
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
semantic_analyzer.visit(tree)
interpreter = Interpreter(tree)
return interpreter
def symbol():
lexer = Lexer(open('text.pas', 'r', encoding='utf-8').read())
parser = Parser(lexer)
tree = parser.parse()
builder = SemanticAnalyzer(spi.ScopedSymbolTable())
builder.visit(tree)
print(builder.symtab)
interpreter = Interpreter()
interpreter.visit(node=tree)
print(interpreter.global_scope)
def main():
argparser = argparse.ArgumentParser(
description='Generate an AST DOT file.')
argparser.add_argument(
'text', help='Arithmetic expression (in quotes): "1 + 2 * 3"')
args = argparser.parse_args()
text = args.text
lexer = Lexer(text)
parser = Parser(lexer)
viz = ASTVisualizer(parser)
content = viz.gendot()
print(content)
def main():
argparser = argparse.ArgumentParser(
description='Generate an AST DOT file.')
argparser.add_argument('fname', help='Pascal source file')
args = argparser.parse_args()
fname = args.fname
text = open(fname, 'r').read()
lexer = Lexer(text)
parser = Parser(lexer)
viz = ASTVisualizer(parser)
content = viz.gendot()
print(content)
def main():
while True:
try:
text = input('spi> ')
except EOFError:
break
if not text:
continue
lexer = Lexer(text)
parser = Parser(lexer)
interpreter = Interpreter(parser)
result = interpreter.interpret()
print(result)
def main():
while True:
try:
try:
text = raw_input('spi> ')
except NameError: # Python3
text = input('spi> ')
except EOFError:
break
if not text:
continue
lexer = Lexer(text)
parser = Parser(lexer)
translator = Translator(parser)
result = translator.translate()
print result
def interpreter(text):
lexer = Lexer(text)
try:
parser = Parser(lexer)
tree = parser.parse()
except (LexerError, ParserError) as e:
return (None, e.message)
semantic_analyzer = SemanticAnalyzer()
try:
semantic_analyzer.visit(tree)
except SemanticError as e:
return (None, e.message)
interpreter = Interpreter(tree)
interpreter.call_stack = TestCallStack()
return interpreter
def test_part10():
text = r"""
PROGRAM Part10;
VAR
number : INTEGER;
a, b, c, x : INTEGER;
y : REAL;
BEGIN
{Part10}
BEGIN
number := 2;
a := number;
b := 10 * a + 10 * number DIV 4;
c := a - - b
END;
x := 11;
x := x / 2;
y := 20 / 7 + 3.14;
{ writeln('a = ', a); }
{ writeln('b = ', b); }
{ writeln('c = ', c); }
{ writeln('number = ', number); }
{ writeln('x = ', x); }
{ writeln('y = ', y); }
END. {Part10}
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
SemanticAnalyzer().visit(tree)
interpreter = Interpreter(tree)
interpreter.interpret()
assert interpreter.GLOBAL_SCOPE == {
"A": 2,
"C": 27,
"B": 25,
"NUMBER": 2,
"Y": 5.997142857142857,
"X": 5.5,
}
def main():
# argparser = argparse.ArgumentParser(
# description='Generate an AST DOT file.'
# )
# argparser.add_argument(
# 'fname',
# help='Pascal source file'
# )
# args = argparser.parse_args()
# fname = args.fname
fname = "assignments.txt"
text = open(fname, 'r').read()
lexer = Lexer(text)
parser = Parser(lexer)
viz = ASTVisualizer(parser)
content = viz.gendot()
print(content)
def test_formal_parameter():
text = """
program Main;
var x, y: real;
procedure Alpha(a : integer);
var y : integer;
begin
x := a + x + y;
end;
begin { Main }
end. { Main }
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
builtins_scope = semantic_analyzer.visit(tree)
global_scope = builtins_scope.global_scope
interpreter = Interpreter(tree)
interpreter.interpret()
assert builtins_scope._symbols == {
"INTEGER": integer_type,
"REAL": real_type,
"MAIN": ProcedureSymbol("MAIN"),
}
assert global_scope._symbols == {
"X": VarSymbol("X", real_type),
"Y": VarSymbol("Y", real_type),
"ALPHA": ProcedureSymbol("ALPHA"),
}
assert global_scope.ALPHA_scope._symbols == {
"A": VarSymbol("A", integer_type),
"Y": VarSymbol("Y", integer_type),
}
assert interpreter.GLOBAL_SCOPE == {}
def test_duplicate_decl_error():
text = """
program SymTab6;
var x, y : integer;
var y : real;
begin
x := x + y;
end.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
with pytest.raises(DuplicateDeclaration) as e:
semantic_analyzer.visit(tree)
assert e.typename == "DuplicateDeclaration"
assert e.value.args == ("'Y'", )
def test_part11():
text = """
PROGRAM Part11;
VAR
number : INTEGER;
a, b : INTEGER;
y : REAL;
BEGIN {Part11}
number := 2;
a := number ;
b := 10 * a + 10 * number DIV 4;
y := 20 / 7 + 3.14
END. {Part11}
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
builtins_scope = semantic_analyzer.visit(tree)
global_scope = builtins_scope.global_scope
interpreter = Interpreter(tree)
interpreter.interpret()
assert builtins_scope._symbols == {
"INTEGER": integer_type,
"REAL": real_type,
"PART11": ProcedureSymbol("PART11"),
}
assert global_scope._symbols == {
"NUMBER": VarSymbol("NUMBER", integer_type),
"A": VarSymbol("A", integer_type),
"B": VarSymbol("B", integer_type),
"Y": VarSymbol("Y", real_type),
}
assert interpreter.GLOBAL_SCOPE == dict(A=2,
B=25,
NUMBER=2,
Y=5.997142857142857)
def test_symtab_exception1():
text = """
PROGRAM NameError1;
VAR
a : INTEGER;
BEGIN
a := 2 + b;
END.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
with pytest.raises(UndeclaredVariable) as e:
semantic_analyzer.visit(tree)
assert e.typename == "UndeclaredVariable"
assert e.value.args == ("'B'", )
def main():
lexer = Lexer(open('text.pas', 'r', encoding='utf-8').read())
parser = Parser(lexer)
interpreter = Interpreter()
interpreter.visit(parser.parse())
print(interpreter.global_scope)
def compute(task):
lexer = Lexer(task)
parser = Parser(lexer)
interpreter = Interpreter(parser)
result = interpreter.interpret()
return result
def test_part_14():
text = """
program Main;
var b, x, y : real;
var z : integer;
procedure AlphaA(a : integer);
var b : integer;
procedure Beta(c : integer);
var y : integer;
procedure Gamma(c : integer);
var x : integer;
begin { Gamma }
x := a + b + c + x + y + z;
end; { Gamma }
begin { Beta }
end; { Beta }
begin { AlphaA }
end; { AlphaA }
procedure AlphaB(a : integer);
var c : real;
begin { AlphaB }
c := a + b;
end; { AlphaB }
begin { Main }
end. { Main }
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
builtins_scope = semantic_analyzer.visit(tree)
global_scope = builtins_scope.global_scope
assert builtins_scope._symbols == {
"INTEGER": integer_type,
"REAL": real_type,
"MAIN": ProcedureSymbol("MAIN"),
}
assert global_scope._symbols == {
"B": VarSymbol("B", real_type),
"X": VarSymbol("X", real_type),
"Y": VarSymbol("Y", real_type),
"Z": VarSymbol("Z", integer_type),
"ALPHAA": ProcedureSymbol("ALPHAA"),
"ALPHAB": ProcedureSymbol("ALPHAB"),
}
assert global_scope.ALPHAA_scope._symbols == {
"A": VarSymbol("A", integer_type),
"B": VarSymbol("B", integer_type),
"BETA": ProcedureSymbol("BETA"),
}
assert global_scope.ALPHAA_scope.BETA_scope._symbols == {
"C": VarSymbol("C", integer_type),
"Y": VarSymbol("Y", integer_type),
"GAMMA": ProcedureSymbol("GAMMA"),
}
assert global_scope.ALPHAA_scope.BETA_scope.GAMMA_scope._symbols == {
"C": VarSymbol("C", integer_type),
"X": VarSymbol("X", integer_type),
}
assert global_scope.ALPHAB_scope._symbols == {
"A": VarSymbol("A", integer_type),
"C": VarSymbol("C", real_type),
}
def makeInterpreter(self, text):
from spi import Lexer, Parser, Interpreter
lexer = Lexer(text)
parser = Parser(lexer)
interpreter = Interpreter(parser)
return interpreter
self.symtab.insert(var_symbol)
def visit_Assign(self, node):
# right-hand side
self.visit(node.right)
# left-hand side
self.visit(node.left)
def visit_Var(self, node):
var_name = node.value
var_symbol = self.symtab.lookup(var_name)
if __name__ == '__main__':
text = """
program SymTab4;
var x, y : integer;
begin
x := x + y;
end.
"""
lexer = Lexer(text)
parser = Parser(lexer)
tree = parser.parse()
semantic_analyzer = SemanticAnalyzer()
semantic_analyzer.visit(tree)
print(semantic_analyzer.symtab)
def makeParser(self, text):
from spi import Lexer, Parser
lexer = Lexer(text)
parser = Parser(lexer)
return parser