| Automatic generation of efficient lexical processors using finite state techniques |
| Full text |
Pdf
(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
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 34, Citation Count: 15
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. H. Bullen, Jr. , J. K. Millen, Microtext: the design of a microprogrammed finite state search machine for full-text retrieval, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California
|
|
|
|
INDEX TERMS
Keywords:
character string,
compiler,
finite-state automata,
finite-state machine,
lexical processor,
nondeterministic machine,
parsing,
plex structure,
regular expressions,
sequential machine,
syntatic analysis
|