Compiler quiz, time 1 hour. 

A simple assembly language (asm) is shown below. 

CLRA
MOV R1,100
MOV R2,200
ADD R1
ADD R2
MOVA R1

Grammar of asm

asm := op oprnd asm | empty
op := CLRA | MOV | ADD | MOVA
oprnd := reg , num | reg | empty
reg := R1 | R2

where num is number such as 100, 200


Computer First and Follow set and construct a parsing table. (You can submit photo of your parsing table).  You have to write your answer by hand.  You can submit your answer in many formats. (ipad, PDF, photo). Please make sure that I can read your answer.

Example of a parsing table is in slide page 25 of parsing.  You can also find it here 

https://www.cp.eng.chula.ac.th/~prabhas//teaching/prolang/2022/write-parser-from-parsing-table.htm

end