GitHub - mawbye/interpreter-: interpreter written for programming languages course

mawbye / interpreter- Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

interpreter written for programming languages course

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 13 Commits
Makefile		Makefile
input.txt		input.txt
interpreter-test.input.01		interpreter-test.input.01
interpreter-test.input.02		interpreter-test.input.02
interpreter-test.input.03		interpreter-test.input.03
interpreter-test.input.04		interpreter-test.input.04
interpreter-test.output.01		interpreter-test.output.01
interpreter-test.output.02		interpreter-test.output.02
interpreter-test.output.03		interpreter-test.output.03
interpreter-test.output.04		interpreter-test.output.04
interpreter.c		interpreter.c
interpreter.h		interpreter.h
linkedlist.c		linkedlist.c
linkedlist.h		linkedlist.h
main.c		main.c
parser.c		parser.c
parser.h		parser.h
readMe.txt		readMe.txt
talloc.c		talloc.c
talloc.h		talloc.h
tokenizer.c		tokenizer.c
tokenizer.h		tokenizer.h
value.h		value.h

Repository files navigation

Justin Lim and Elliot Mawby
Dave Musicant, CS251
Interpreter test input files readMe.txt

01 - tests letrec() by defining two recursive functions in letrec and then executes them in body. Also tests primitive arithmetics (+), (=), and (-).

02 - tests more primitive arithmetics: (*), (/), (<), (>), and (modulo). Also tests the difference between let and let*, which uses primitive (=).

03 - Demo cases from assignment example. Tests (car), (cdr), (cons), and (null?).

04 - simplified cases from previous Racket homework assignment. User defined functions first-n and nth that return the first-n and nth items of a given list. Tests (null?), (-), (=), (car), (cdr), and (cond).

Extra stuff: implemented (booleans?) primitive that tests whether input evaluates to a boolean. arithmetic primatives should evaluate to int or double based on input.