Software—Practice & Experience
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The automatic generation of Fast Lexical Analysers
Software—Practice & Experience
The syntax definition formalism SDF—reference manual—
ACM SIGPLAN Notices
Incremental generation of parsers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A mete-environment for generating programming environments
Algebraic methods II
Lazy and incremental program generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Incremental Generation of Parsers
IEEE Transactions on Software Engineering
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Lazy and incremental program generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An evaluation of an automatically generated compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Enhancing byte-level network intrusion detection signatures with context
Proceedings of the 10th ACM conference on Computer and communications security
ACM SIGPLAN Notices
Renovation of the Asf+Sdf meta-environment: current state of affairs
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Implementation of a prototype for the new ASF+SDF meta-environment
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Mealy machines are a better model of lexical analyzers
Computer Languages
| Hi-index | 0.00 |
It is common practice to specify textual patterns by means of a set of regular expressions and to transform this set into a finite automaton to be used for the scanning of input strings. In many applications, the cost of this preprocessing phase can be amortized over many uses of the constructed automaton. In this paper new techniques for lazy and incremental scanner generation are presented. The lazy technique postpones the construction of parts of the automaton until they are really needed during the scanning of input. The incremental technique allows modifications to the original set of regular expressions to be made and reuses major parts of the previous automaton. This is interesting in applications such as environments for the interactive development of language definitions in which modifications to the definition of lexical syntax and the uses of the generated scanners alternate frequently.