Compiler construction: Given 5 regular grammar, find accepting language and formal descriptions.

3 SOES 31 5 La E tot DOO +... = 07 G={N, E, R.5) N=15) 2 = 103 SES R: soas 1 4. SOS lis 31 S S S S S S 1 1 OS E is i } 1 E } L=E 1 00 + I + 10 + Co+1) S old (0+1).(0+1) Coto) = 10+1) Regular grammar HWA G={N, E, R, S} G= {NE, R.S} D G A AB BE a B L=a N-LA.B} Infus SEA R: AaB 13 2) G: A At aB | kB G={H, E,R,S} B-C N=LA,B3 I - 1 aulas S2A R: A+B | BB B Louth G={N, D, R.5) N- Non-terminal S- Terminal ( Alphabet) R- Rules 5 - start Non-terminal Gernered, flw,s) - CN, E) Regular x y Y XE Left: single non-terprised, X Right. E single terminal, Y, followed by singla. Non-tawanad, Y