Jack W. Davidson. Simple machine description grammars. Technical Report CS-85-22, Department of Computer Science, University of Virginia, Charlottesville, VA, November 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is called RTL (Register Transfer Lists) RTL consists of a representation for machine instructions and a method of conveying source language information to vpo. The part of RTL that encodes machine instructions is based on the ISP notation of Bell and Newell. Original RTL descriptions were ad hoc [DAVI85]. Over the years, this portion of the RTL representation has evolved into a compact, well defined language for describing the instruction sets of machines [BENE94a] Over 20 architectures have been described. However, to be most effective, a global code improver needs more than target machine ....

Davidson, J. W., `Simple Machine Description Grammars' Technical Report TR85-22, Department of Computer Science, University of Virginia, Charlottesville, VA., November 1985.

.... use of a new and elegant representation of the data flow properties of a program, static single assignment form [CFR 89] The current version of the optimizer owes a great deal to an earlier version described in [Wie87] That version, in turn, was based on work described in [DF80] Dav81] DF84] [Dav85]. 1 Smalltalk 80 is a trademark of PARC Place Systems Chapter 2 The Register Transfer Language RTL The RTL System is based on an intermediate register transfer language (RTL) RTL is a compact language with operations so elementary that every machine has them, thus ensuring that every RTL ....

Jack W. Davidson. Simple Machine Description Grammars. Technical Report, Department of Computer Science, University of Virgina, 1985.

....aspects. In this paper, we present a system for building computing system descriptions that are application dependent, but can still be shared among many applications. 1. 1 Application Independence The use of a machine description can significantly reduce the retarget time of an application [Wic75, Cat78, GH84, Dav85, BHE91, RF95]. However, with each retarget of the application, a description for the new target machine must be written. For an application of any substance, this itself can be a daunting task. There are three sources of difficulty: 1. Information about the machine must be found, encoded using whatever ....

Jack W. Davidson. Simple machine description grammars. Technical Report CS-85-22, Department of Computer Science, University of Virginia, Charlottesville, VA 22903, November 1985.

....to produce a parser that checks the syntax of an RTL. The semantic actions check context sensitive constraints imposed by a particular architecture. Currently, the RTL parsers are constructed using the Unix parser generator yacc [Joh78] 2 Machine description grammars are relatively easy to write [Dav85]. The goal is to compose a grammar with semantic actions to produce a parser that accepts all legal RTLs (instructions) and rejects all illegal RTLs. In our experience it is easier to write a machine description for an instruction set than it is to write a grammar for a programming language. The ....

J. W. Davidson, "Simple Machine Description Grammars", TR85-22, University of Virginia, November 1985.

No context found.

Jack W. Davidson. Simple machine description grammars. Technical Report CS-85-22, Department of Computer Science, University of Virginia, Charlottesville, VA, November 1985.

No context found.

J. W. Davidson, Simple Machine Description Grammars, Computer Science Technical Report 85-22, University of Virginia, Charlottesville, VA, November 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC