Referenced Items are not available for this document.
Most parser generators do not work with lexically complex languages like Fortran. Compiler writers end up writing lexers by hand. To deal with this complexity, the author suggests generating a parser that uses a series of boxes-like a mechanical caterpillar-instead of just two
Published in:
Software, IEEE
(Volume:12
,
Issue:
5
)
Date of Publication: Sep 1995
- Page(s):
- 61 - 67
- ISSN :
- 0740-7459
- INSPEC Accession Number:
- 5095980
- Digital Object Identifier :
- 10.1109/52.406759
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 1995
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
