Compiler HWK#3 Due date: 2:20pm, April 21, 2005


Consider the following grammar

        E -> E + T | T
	T -> T F | F | epsilon
        F -> F * | a | b

(1) Compute the SLR(1) parsing table.

(2) Is this grammar in SLR(1)? Explain your answers.

Note: (a) E is the starting nonterminal.
      (b) To submit your homework, send an email to comp05@csie.ntu.edu.tw
          subject: HWK2: your student number and name
                   eg: "HWK3 - B91922xxx ¤ý¤p©ú"
          attachments: your homework in either text, pdf, ps or html format.