The PowerPC 604 RISC Microprocessor - eisber.net

Recommendations

Info

The interpreter is cIssical: it executes straight line codeand goto instructions. It is completely blind to the structureof the tree and requires neither recursion nor a stackto execute a file tree. Access to variables and proceduredefinitions is through a symbol table.The editor walks the tree using the same goto pointersas the interpreter. Each cursor position designates one ofthe nodes of the tree. Cursor motion is defined withrespect to a preorder traversal_ There are no backwardpointers; thus, backward cursor motion is implementedinternally by going all the way around.B. DeclarationsAs demonstrated in Sec. LI.C, declarations present aspecial problem: modifying a declaration can simultaneouslyintroduce errors and correct errors at otherlocations in the program.. Internally, information aboutidentifiers is stored in a symbol table. When a declarationis modified, the Synthesizer discards the old symbol tableand traverses the tree in preorder reparsing and redoingthe semantics of every phrase. Phrases with errors are--Irked as invalid and are printed in the highlighted font_Len the screen is redrawn. Because the allocation ofvariables within an activation record is recomputed inthe process of reconstructing the symbol table, access tothe variables of a suspended activation record is lost inthe process. Therefore, execution cannot be resumedafter such modifications.C. Displaying the TreeThe print representation of a file is generated fromthe tree; a text representation is not saved.. The externalrepresentation of each kind of template is stored in atable: The entries of this table alternate between terminalstrings and placeholder-descriptors. For example, the IFtemplateis encoded as:"IFcondition-descriptor") \ \nTHEN"--gement-I-descriptor_LSE"statement-2-descriptorThe placeholder-descriptors identify the placeholdersand their positions within the code section of an internalnode. The terminal strings contain key words, punctuationmarks, and formatting control characters that areinterpreted on output. For example,\ ( means move left -margin right one unit,\n means line-feed, carriage-return to current left -mar-gin,\} means move left-margin left one unit,\r means carriage-return to current left-margin.The print routine traverses the tree in preorder, simultaneouslykeeping track of position within the externalrepresentation of the appropriate template. Each term:-nal string encountered is printed and its formattingcommands obeyed. Each phrase is translated from postfixto infix for display. (The parentheses of a phrase aresaved in the extension of the node encoded one bit peroperator.)As the tree is traversed for display, a table mappinginternal node addresses to external screen coordinates isupdated_ This table is used both for cursor motion in theeditor, and at runtime for the trace feature_D. Implementation of Debugging FeaturesThe tracing, pacing, and single-step features are implementedby taking appropriate action on the interpretationof each goto leading to a new node.When tracing, each goto uses the map from internalnode addresses to screen coordinates to determinethe new cursor'position. If the map is not defined for agiven target node, then the cursor lies outside the windowand the program is redrawn with the new cursor positioncentered in the window. Traced programs are neverpermitted to run any faster than one cursor update perrefresh of the video screen in order to avoid stroboscopiceffects such as loops that appear to run backwards. Whenpacing, the interpreter waits appropriately at eachgoto before continuing execution. When stepping, theinterpreter waits for a resume command before continuing.The variable-monitoring feature is implemented in astraightforward manner. a table mapping identifiers toscreen positions is maintained. Assignment to a monitoredvariable is detected by the interpreter whereuponthe appropriate position is updated on the screen.Reverse execution also has a straightforward implementation:the forward execution interpreter maintainsa history file of the flow of control and the valuesdestroyed by assignments to variables. The reverse executioninterpreter restores values and updates the screento give the illusion of the program executing backwards.VII. Tne Synthesizer GeneratorContinuing research and development of the Synthesizerwill increase its power, versatility, and range ofapplication complementing the unique syntax-directedmechRnisms the environment already provides. For example,global data flow analysis techniques will be usedto answer queries about static program structure, as in[IS]. The video display can be used to express staticrelationships between components of a program; themultiple fonts of a terminal can be exploited to highlightregions of interest. For example, the programmer mightrequest the highlighting of all uses or all assignments toa variable X. Alternatively, the analysis can be keyed tothe present location of the editing cursor. For example.,the programmer might request the highlighting of allassignments to X that can account for its value at thepresent cursor location, or all possible uses of X that can572 Communications September 1981of Volume 24thc ACM Number 9
I- be reached from the present cursor location.To facilitate such further development, we are implementinga language-independent system for generatingSynthesizer-like systems from a grammatical specificationof a given programming language. An attributegrammar will be used to define the syntax, displayformat, and semantics of each template and phrase_ Inour application, where program units are inserted anddeleted in arbitrary order, semantic analysis must beboth incremental and reversible. For this purpose, attributegrammars have the advantage of expressing semanticsand context-sensitive constraints applicatively andon a modular basis; the arguments to each semanticfunction are imported explicitly from neighboring nodesin the derivation tree.Because propagation of semantic informationthrough the tree is implicit in the formalism, an incrementalattribute evaluator can update the appropriateattribute values in conjunction with each editing operation.In particular, because the attribute dependenciesare known, the evaluator can delete semantic informationautomatically when program units are deleted; aseparate mechanism to undo semantics is not needed.ye have described one such incremental attribute evaluatorin [8]; more recently, we have developed an optimal-dineincremental evaluator that runs in time proportionalto the number of attribute values that actuallymust be changed 121].Acknowledgmen:s. Many people have-participated inthe development of the Synthesizer. We are deeply indebtedto A. Demers for many stimulating discussionsand for writing the LSI-I 1 operating system kernel; hisinsights and assistance have been invaluable. We arealso extremely grateful for the generous help of 3. Archer,R. Conway, M. Fingerhut, D. Gries, C. Hauser, S.Horwitz, D. Jacobs, R. Johnson, D. Krafft, S. Mahoney,and R. Olsson.Received 5/80; revised and accepted 4/81ReferencesAlberga, C.N, Brown, A.L, Leeman, G.13, Mikelsons, M, andWegrnan, M.N. A program development tooL Conference Record ofthe 8th Ann. Syrup. on Principles of Programming Languages,Williamsburg, VA, Jan., 1981,92-104.2. Archer, J., Conway, R., Shore, A., and Silver, L The CORE userinterface. Tech. Report No. TR80-437, Dept of Comptr. Sci_, CornellUniv., Ithaca, NY, Sept. 1980.3. Balzer, R.M., EXDAMS-EXtendabIe Debugging and MonitoringSystem, AFIPS Proc. V. 34 (SJCC 1969), 567-580.4. Constable, R_ and O'Donnell. MJ. A -Programming Logic.Winthrop, Cambridge, MA, 1978.5_ Conway. R. and Constable. R. PL/CS-A disciplined subset ofPL/I. Tech. Rept No. 76-293, Dept. of Comptr. Sci., Cornell 1976.6. Conway. R. Primer on Disciplined Programming Using PL/CS.Winthrop. Cambridge, MA, 1978.7. Conway, R. and Gries, D. An introduction io programming-asiruciured approach using PL/I and PL/C. Winthrop, Cambridge,MA, 1979, 135-137.8_ Demers, A., Reps, T., and Teitelbaum, T. Incremental evaluationfor attribute grammars with application to syntax-directed editors.CnrIfererice Record of the 8th Ann_ Syrup. on Principles ofProgramming Languages, Williamsburg. VA, Jan.. 1981.9. Donzeau-Gouge, V, Hue:, 0_, Kahn, G„ Lang, B., and Levy,A structure-oriented program editor. Tech. Rept, IRIA-LABORIA, -France 1975.10. Eagetbart, D.C. and English. W.K. A research center foraugmenting human intellect. AFIPS Proc. V. 33 (FJCC, 1968).11. Feiler, P.H. and Medina-Mora„ R., An incremental programmingenvironment. Dept. of Comptr. Sci„ Carnegie-Mellon Univ,Pittsburgh, PA, April 1980.12. Hansen, W. Creation of hierarchic text with a computer display.Ph.D. Thesis, Comptr. Sci. Dept., Stanford University, Stanford, CA,June 1971.13. Haberrnann,'A.N. An overview of the Gandalf project. Comptr.Sci- Res_ Rev. 1978-79, Carnegie-Mellon Univ., Pittsburgh, PA, 1979.14. Hodgson, Ll., and Porter, M. B1DOPS: A bi-directionalprogramming system. Dept_ of Comptr. Sci_ Univ. of New England,Armidale, N.S.W., Australia, 1980.15. Joy, B. Ex Reference manuaL Dept. of Electrical Eng. andComptr. Sci., Univ. California, Berkeley, CA, 1977.16. Kurtz, T.E. BASIC. SIG PLAN Notices, Aug. 1978.17. Lewis, J.W. and Porges, D.F. ALBE/P: a language-based editorfor rascaL Dept. of Comptr. Sci., Yale Univ., New Haven, CT.18. Masinter, L.M. Global program analysis in an interactiveenvironment. Xerox PARC Report SSL-80-1, Jan. 1980.19. Mikelsons, M. and Weg,mari, M.N. PDE IL: The PLIL programdevelopment environment principles of operation. Res. Rept RC8513,IBM, Thomas J. Watson Research Center, Yorktown Heights, NY,Nov. 1980.20. Pine, J.H. and Schwcppc, E.J. A Fortran language anticipationand prompting system. PTOC. ACM Nat Cont., Atlanta, Georgia,1973.21. Reps, T. Optimal-time 'incremental semantic analysis for syntaxdirectededitors_ Tech. Report No. 81-453, Dept. of Comptr. Se,Cornell University, Ithaca, NY, March 1981.22. Skinner, G. God user documentation. Dept_ of Comptr. Sci,Cornell Univ., Ithaca, NY,23. Teitelbaum, T. A formal syntax for PL/CS. Tech Rept 76-281,Dept. of Comptr. Sci., Cornell Univ., Ithaca, NY, 1976.24. Teitelbaum, T. The Cornell Program Synthesize= amicrocomputer implementation of PL/CS. Tech. Report No. TR79-370, Dept. of Comptr. Sci., Cornell Univ., Ithaca, NY, Jane 1979.25. Teitelbaum, T. The Cornell program synthesizer: A tutorialintroduction. Tech. Report No. TR79-381. Dept. Comptr. Sci,Cornell Univ., Ithaca, NY, July 1979, Revised Jan. 1980.26. Teitelman, W. IN-TM-RI ISP reference manuaL Xerox PARC,1974.27. Teitelman, W. A display-oriented programmer's assistant XeroxPARC, March 1977.28. Wilcox, TR., Davis, A.M., and Tindall, M.E. The design andimplementation of a table driven, interactive diagnostic programmingsystem_ Comm. ACM 19, 11 (Nov. 1976), 609-616.29. Zelkowitz, M. Reversible execution as a diagnostic tool. Ph.D.Thesis, Dept. of Comptr. Sri, Cornell Univ, Ithaca, N.Y., Jan. 1971.573Communications September 1931of Volume 24the ACM Number 9
Page 1 and 2:
The PowerPC 604 RISC Microprocessor
Page 3 and 4:
Rename valid I Reg num Result Resul
Page 5 and 6:
updated by speculatively executed m
Page 7 and 8:
PowerPC 604Reservation stationRA (0
Page 9 and 10:
Data addressInstruction address•M
Page 11 and 12:
Threaded Codethreaded = aufgefadelt
Page 13 and 14:
token threaded codeindirect token t
Page 15 and 16:
Kosten auf dem MIPS 83000indirect t
Page 17 and 18:
CTIL'Start / Restart' 14ZIP Funktio
Page 19 and 20:
SystemparameierStackbefehleKarmen a
Page 21 and 22:
KontrollstrukturenBEGIN ... END Sch
Page 23 and 24:
Stack Framelocal stacklocalsparamet
Page 25 and 26:
122 The P-code Machine [Ch.Thus the
Page 27 and 28:
68Pascal Implementation: Compiler a
Page 29 and 30:
72 Pascal Implementation: Compiler
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Tables of Lexical Analysis123456frw
Page 37 and 38:
JVIII ■ 111t14 /1.11111ySIS ai Y
Page 39 and 40:
4Pascal implementation: Compiler an
Page 41 and 42:
8 Pascal Implementation: Compiler a
Page 43 and 44:
12 Pascal implementation: Compiler
Page 45 and 46:
16Pascal Implementation: Compiler a
Page 47 and 48:
30 Pascal inipletnentatIon: Compile
Page 49 and 50:
34 Pascal implementation: Complier
Page 51 and 52:
if) 1993, 1994, 1995 Sim Microsyste
Page 53 and 54:
0-PrefaceThis document describes ve
Page 55 and 56:
method calls into actual method cal
Page 57 and 58:
auper_el arsThis field is an index
Page 59 and 60:
ATtagbytesCONSTANT_Integer_infoul t
Page 61 and 62:
2.6.1 SourceFileThe "SourceFile" at
Page 63 and 64:
local ..verieble_table_lengthThis f
Page 65 and 66:
1dc2wPush long or double from const
Page 67 and 68:
I 3.4Storing Stack Values into Loca
Page 69 and 70:
anewarrayAllocate new array of refe
Page 71 and 72:
PastoreStore into single float arra
Page 73 and 74:
laddLong integer addfSubSingle floa
Page 75 and 76:
dreminegInegInegdnegDouble float re
Page 77 and 78:
IliLong integer to integerSyntax:L
Page 79 and 80: ifleBranch if less than or equal to
Page 81 and 82: dcmpgDouble float compare (1 on NaN
Page 83 and 84: 3.13 Table JumpingtableswitchAccess
Page 85 and 86: the matched method is found. The me
Page 87 and 88: Appendix A: An OptimizationA.2 Push
Page 89 and 90: cpgetfield2_quickFetch held from ob
Page 91 and 92: checkcast_quickMake sure object is
Page 93 and 94: Efficient JavaVM Just-in-Time Compi
Page 95 and 96: The second pass of the compiler tra
Page 97 and 98: chain length 1 2 3 4 5 6 7 8 9 >9oc
Page 99 and 100: sieve JavaLex javac espresso i Toba
Page 101 and 102: Technical Overview of the Common La
Page 103 and 104: In contrast to the JVM where all st
Page 105 and 106: The ldind t instruction expects an
Page 107 and 108: It should be obvious that having va
Page 109 and 110: 9 Interaction between value and ref
Page 111 and 112: 2. CLI Partition II: Metadata. http
Page 113 and 114: Anforderungen an den Zwischencode
Page 115 and 116: DieRoboterprogrammiersprache• kei
Page 117 and 118: Implementierung des Interpreters•
Page 119 and 120: Printed by andi from a0.complang.tu
Page 129: power but retain the disciplined vi
Page 133 and 134: the editor will be invoked asking t
Page 135 and 136: immediately that 'I' has type integ
Page 137 and 138: --y-PASC7,1,.The useof a formal lan
Page 139 and 140: Implementation Techniques for Prolo
Page 141 and 142: x(X) a(A)a(C) b(C), c(C)b(s(0))c(s(
Page 143 and 144: Unification in general consists of
Page 145 and 146: for the classification of temporary
Page 147 and 148: copy stack1trailenvironment stack1t
Page 149: process reduction attempt are elimi
show all

The PowerPC 604 RISC Microprocessor - eisber.net

Create successful ePaper yourself

Delete template?

Save as template?