Constructing the DFA: start state & closure First step: Add a new production TAS$ to the grammar Start state: TH.S$ TAS$ SH(L) | id LAS | LES Exercise: Which productions could we use to generate the first terminal of an input? Example inputs: x (x, y) ((x, y), z) 26