Document not found! Please try again

stdin (ditroff)

3 downloads 43 Views 17KB Size Report
AN AUTOMATON FOR PROGRAMMING-LANGUAGE IDENTIFIERS start. L. T. E. S accept. L. D. Chomsky (Type 3) grammar for the above
AN AUTOMATON FOR PROGRAMMING-LANGUAGE IDENTIFIERS L start

L

E

T

S

D Chomsky (Type 3) grammar for the above S → LT T → DT T → LT T→E L → ’a’ | ’b’ | ... | ’z’ | ’A’ | ’B’ | ... | ’Z’ D → ’0’ | ’1’ | ’2’ | ’3’ | ’4’ | ’5’ | ’6’ | ’7’ | ’8’ | ’9’ E → ’;’ BNF (Backus-Naur Form) alternative ::= ::= ::= ::= ::= ’a’ | ’b’ | ... | ’z’ |’A’ | ’B’ | ... | ’Z’ ::= ’0’ | ’1’ | ’2’ | ’3’ | ’4’ | ’5’ | ’6’ | ’7’ | ’8’ | ’9’ ::= ’;’

accept