Formal compiler descriptions serve two purposes: (1) they can be used as a reference document which specifies the syntax and the semantics of a language, and (2) they provide a convenient notation from which efficient compilers can be generated. Compiler generating systems put emphasis on either the one or the other of these aspects. The system described in this report mainly concentrates on the second goal. We show that it is possible to generate compilers that are as efficient as hand-coded and carefully optimized production-quality compilers. Our system generates recursive descent parsers with a simple error-handling mechanism and scanners with a special buffering scheme. Almost as important as efficiency is the simplicity and adequacy o...
In this paper, we address the different conceptual and technical difficulties encountered when embed...
AbstractReduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing ...
A method for quickly producing compilers for high level languages is described. The technique consis...
Given a complete, formal description of the semantics of a programming language, it should be possib...
The construction of compiler front and back-ends is understood well enough for a great deal of the w...
The FAST compiler is a backend for compilers of lazy functional languages. There are two versions of...
: This tutorial considers the design of modern machine-independent optimising compilers for classica...
Most people write their programs in high-level languages because they want to develop their algorith...
As both computer languages and architectures continue to proliferate, there is a continuing need for...
Several recently developed semantics systems automatically generate compilers from denotational desc...
Compiler theory is a core module in most computer science courses. The tools and techniques used in ...
Action Semantics is a new and interesting foundation for semantics based compiler generation. In th...
AbstractReduction Incorporated (RI) parsers deliver high performance by suppressing the stack activi...
This paper describes reusable parser generation from source code of popular open source compilers fo...
Abstract. Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which...
In this paper, we address the different conceptual and technical difficulties encountered when embed...
AbstractReduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing ...
A method for quickly producing compilers for high level languages is described. The technique consis...
Given a complete, formal description of the semantics of a programming language, it should be possib...
The construction of compiler front and back-ends is understood well enough for a great deal of the w...
The FAST compiler is a backend for compilers of lazy functional languages. There are two versions of...
: This tutorial considers the design of modern machine-independent optimising compilers for classica...
Most people write their programs in high-level languages because they want to develop their algorith...
As both computer languages and architectures continue to proliferate, there is a continuing need for...
Several recently developed semantics systems automatically generate compilers from denotational desc...
Compiler theory is a core module in most computer science courses. The tools and techniques used in ...
Action Semantics is a new and interesting foundation for semantics based compiler generation. In th...
AbstractReduction Incorporated (RI) parsers deliver high performance by suppressing the stack activi...
This paper describes reusable parser generation from source code of popular open source compilers fo...
Abstract. Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which...
In this paper, we address the different conceptual and technical difficulties encountered when embed...
AbstractReduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing ...
A method for quickly producing compilers for high level languages is described. The technique consis...