ACM Home Page
Please provide us with feedback. Feedback
Automatic generation of efficient lexical processors using finite state techniques
Full text PdfPdf (1.12 MB)
Source
Communications of the ACM archive
Volume 11 ,  Issue 12  (December 1968) table of contents
Pages: 805 - 813  
Year of Publication: 1968
ISSN:0001-0782
Authors
Walter L. Johnson  Ford Motor Co., Dearborn, MI
James H. Porter  Chevron Research Company, Richmond, CA
Stephanie I. Ackley  System Development Corp., Santa Monica, CA
Douglas T. Ross  Massachusetts Institute of Technology, Cambridge
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 34,   Citation Count: 15
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/364175.364185
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
An algorithmic theory of language. Rep. No. ESL- TM-156, Electron. Syst. Lab., MIT, Cambridge, Mass., Nov. 1962.
 
3
CHEATHAM, T. E., JR. The TGS-II translator generator system. Proc. IFIP Cong., 1965, Vol. 2, pp. 592-593.
4
 
5
FLOYD, R. W. The syntax of programming language-a survey. IEEE Trans. (Aug. 1964), 346-353.
6
 
7
McNAUGHTON, R. Techniques for manipulating regular expressions. MIT memo, Cambridge, Mass., Nov. 1965.
 
8
--, AND YAMADA, H. Regular expressions and state graphs for automata. In Moore, E. F. (Ed.), Sequential machinesselected papers, Bell Tel. Labs., Inc., Murray Hill, N.J.
 
9
SHANNON, D. E., AND McCARTHY, J. Automata Studies. Princeton U. Press, Princeton, N. J., 1956.
10
11

CITED BY  15

Collaborative Colleagues:
Walter L. Johnson: colleagues
James H. Porter: colleagues
Stephanie I. Ackley: colleagues
Douglas T. Ross: colleagues