Regular Expression

개념 정리

Project 1 Scanner 구현

Project 2 Parser

lexical anay → 한번에 하나만 만든다.

anayzer ( ~pase tree 두개 ,)( semantic an)


tiny sample launguate → language defined by the textbook. ( very simple laun..~)

integer division → output is integer.

0< x ⇒ boolean expression.

until x= 0 → == in c launguage .


analyze.j → semantic anayze

code = code optimization.

cgen → code generation.

t심볼테이브 액세스 빨리 하기 때문에 → efficient 하게 해야해서 해쉬 테이블.


build symbol table , type checking → semantic analyiss

lexical & syntax anapys4s → generate the syntax tree.

annotated syntax tree → code Gen ( annotree)