parsing, ast & semantic

Tiger Compiler Project

By Mu Li

2007-3-8Li, Mu ([email protected]) 2

We assume you are familiar with according theory backgrounds mentioned in dragon book (or tiger book)


Provided in LexerTest.java


Use CUP to implement the parser◦Easy◦Only grammar specification is needed


Terminals and non-terminals

Precedences

The grammar


Following the expressions defined in Tiger Manual


…

Notice %Cup in your tiger.flex, which make Jflex implement java_cup.runtime.Scanner


Run CUP, parser.java and sym.java obtained

More information, you should read the documents provided by Jflex and CUP


Provided in CupTest.java


(a := 5; a+1) can be translated into


Tree’s nodes are defined in tiger.absyn

Your should make your compiler know the structure by CUP


…

…

OpExp defined as:


Using class tiger.absyn.Print


Check type


let type a=btype b=ctype c=intvar x:a:=3

in a:=“hello world”

end


let type a=btype b=ctype c=a……

in ……

end


letfunction g (a:int , b:string):int = a

ing("one")

end


let

type arrtype = array of inttype rectype = {name:string, id: int}

var rec := rectype {name="aname", id=0}var arr := arrtype [3] of 0

inif rec <> arr then 3 else 4

end


for i:=10 to " " do i := i - 1


You should print the AST and check the types

The specification is on our website Deadline is 30th Mar. NO cheating!


parsing, ast & semantic

Documents

class tiger

tiger book2007

tiger manual2007

btype b

ctype c

var rec

var arr

inif rec arr