A new method for compiler code generation

Glanville, R. Steven; Graham, Susan L.

doi:10.1145/512760.512785

Cited by 137 publications

(46 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[5]. A more restrictive approach is typically taken by the code generation parsers [2][3][4] were such a condition is referred to as semantic blocking. This situation is avoided by checking when the parser is constructed that a default production has been supplied that contains no restrictions and hence can never fail.…”

Section: Handling Embedded Restrictionsmentioning

confidence: 99%

See 1 more Smart Citation

LR parsing of CFGs with restrictions

McKenzie

1990

Softw Pract Exp

View full text Add to dashboard Cite

SUMMARYA method for extending the LR parsing method to enable it to deal with context free grammars containing imbedded restrictions is presented. Such restrictions are usually dealt with in LR based parsers by executing semantic code outside the context of the LR method. By including such restrictions within the LR method itself, potential shiftreduce and reduce-reduce conflicts can be resolved and provide greater control over the language accepted. The proposed method can be easily incorporated into existing LR based parser generating systems.

show abstract

Section: Handling Embedded Restrictionsmentioning

confidence: 99%

“…Existing LR-based parser generator systems [5,6] Grammars such as D are dealt with using a maximal-munch approach [2][3][4].…”

Section: Introductionmentioning

confidence: 99%

LR parsing of CFGs with restrictions

McKenzie

1990

Softw Pract Exp

View full text Add to dashboard Cite

show abstract

“…For example, a[i]'s address is formed in r [16] to preserve the shifted value of i in r [15]. Common subexpression elimination will reuse r [15] in the formation of b[i]'s address, and computations used only once will be absorbed into larger instructions wherever possible.…”

Section: Inputmentioning

confidence: 99%

Code selection through object code optimization

Davidson

Fraser

1984

ACM Trans. Program. Lang. Syst.

104

View full text Add to dashboard Cite

This paper shows how thorough object code optimization has simplified a compiler and made it easy to retarget. The code generator forgoes case analysis and emits naive code that is improved by a retargetable object code optimizer. With this technique, cross-compilers have been built for seven machines, some in as few as three person days. These cross-compilers emit code comparable to hostspecific compilers.

show abstract

“…Algorithms such as [4,15,2] and [14] perform cost computations at preprocessing time, whereas [7,1,13] [5] perform them at matching time. Graham and Glanville [6] used LR(0) parsing techniques for retargettable code generation. However, their technique cannot be applied to regular tree pattern matching in general, as it does not carry forward all choices until an optimal decision can be made.…”

Section: Introductionmentioning

confidence: 99%

Optimal Regular Tree Pattern Matching Using Pushdown Automata

Madhavan

Shankar

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the conventionally generated tree pattern matching automaton. Our technique can handle a larger class of cost augmented regular tree grammars than can be preprocessed by conventional methods, and has been tested on some input problem instances representing instruction sets for processors.

show abstract

A new method for compiler code generation

Abstract: An algorithm is given to tively low-level intermediate program into assembly code or A NEN METHODFOR COMPILER CODEGENERATION (Extended Abstract)* !-?.

Cited by 137 publications

References 8 publications

LR parsing of CFGs with restrictions

LR parsing of CFGs with restrictions

Code selection through object code optimization

Optimal Regular Tree Pattern Matching Using Pushdown Automata

Contact Info

Product

Resources

About