The PowerPC 604 RISC Microprocessor - eisber.net

Recommendations

Info

Programmablauf des EditorsInitialisierungEingabeaufforderungEinlesen des BefehlsAnalyse and Auswahl des BefehlsAusfuhren des BefehlsAusgabe des Programmtextessolange Name oder NummerEinlesen von Name oder NummerAusgabe des Programmtextesbis B efeh gleich QuitAnalyse der Befehle erfolgt tabellengesteuert'ndizes: Zustand des Programmbumes, eingegebene ZeichenIn halt: Unterprogramm mit optionalen ParameterAusgabe des Programmtextes:• Schablonen stehen in Tabelle (mit Zeileninformation)• Einrucktiefe ist die Tiefe des Syntaxbaums
Printed by andi from a0.complang.tuwien.ac.atMar 29 1996 16:42 KarefTheRobot.java Page 1/' Karel the Robot, a computer language learning game after Pettis/' Author: Andreas Krall/' Last Change: 96/03/28interface Globals// error and return codesstaticstaticstaticfinalfinalfinalint simple_instr_finishedint no_errorint robot_made_turnoff- --1;. 0;- I;static final int double_definition_error - 2;static final lot incomplete_program_error . 3;static final int blocked_robot_error . 4;static final int end_of_world_error . 5 ;static final int no_beeper_error • 6 ;static final int empty_bag_error . 7 ;static final int missing_turnoff_error . 8 ;static final int back_end_reached_error - 9;static final int stack_overflow_error ■ 10;static// testfinal int internal_program_errorcodes and names- 11;////must be < 0must be 0static final int undef_test • 0; // must be 0static final int front_is_clear 1;// must be previous 1static final int left_ia_clear . 2;static final int right_is_clear • 3 ;static final int next_to_a_beeper 4;static final int facing_north - 5; // north must be east - 1static final int facing_east 6; // east must be south - 1static final int facing_south■ 7 ; // south must be west - 1static final int facing west■ 8 ;// west must be south 4 Istatic final int any_beepers_in_bag ■static final int front_is_blocked • 10;static final int left_is_blocked - 11;static final int right_is_blocked • 12;static final int not_next_to_a_beeper 13;static final int not_facing_north 14;static final int not_facing_east • 15;static final int not_facing_south . 16;static final int not_facing_west - 17;static final int no_beepers_in_bag 18;static final String test_names(I - ('",'front_is_clear','left_is_clear','right_is_clear','next_to_a_beeper','facing_north'.'facing_east','facing_south','facing_west','any_beepers_in_bag''front_is_blocked','left_is_blocked','right_is_blocked','not_next_to_a_beeper','not_facing_north*,'not_facing_east','not_facing_south','not_facing_west','no_beepers_in_beg'1:// basic instruction codes and namesstatic final int undef_instr 0; // must be 0•,Mar 29 1996 16:42 KarelTheRobot.java Page 2static final int move_inatr - 1; // must be previous • 1static final int turnleft_instr . 2;static final int putbeeper_instr 3;static final int pickbeeper_instr 4;static final int turnoff_instr . 5;static final String instruction_names() ('', 'move', 'turnleft', 'putbeeper', 'pickbeeper', 'turnoff'1;// node codes and node element description codesstatic final tnt is_undef . 0; // must be less than is_numberstatic final int program_node 1; // must be less than is_numberstatic final int define_node = 2; // must be less than is_numberstatic final int execution_node = 3: // must be less than is_numberstatic final tnt block_node - 4; // must be less than is_number// must be less than is_numberstatic final int while node - 5;static final int iterate_node - 6; // must be less than is_numberstatic final int if_then_else_node • 7;static final int call_node • 8;// must be less than is_number// must be less than is_number// must be less than is_number// must be less than is_numberstatic final int basic_instr_nodestatic final int is_program..9;10;static final int is_executionstatic final int is_def_list. 11;• 12;// must be lees than is_number// must be lees than is_numberstatic final int ie_stmt . 13; // must be less than is_numberstatic final int is_etmt_list = 14; // must be less than is_numberstatic final int is_number • 15;static final int is_teat . 16: // must be greater than is_numberstatic final int ia_name . 17; // must be greater than is_numberstatic final int is_instr . 18; // must be greater than is_numberfinal class KarelTheRobot implements Globals(static int offset 0; // offset of current instructionstatic Node instruction null; // current instruction// left searches to the next left positionstatic void left()Node instr instruction;if (offset 0) ( // find previous node in listwhile (inatruction.offnet 0) // find last node in listinstruction - instruction.next;offset • instruction.offset - 1; // set parent offsetinstruction ■ instruction.next; // set parent nodeif (instruction.get_node_at_pos(offset) instr)offset--;// original node is list headelseinstruction instruction.get_node_st_pos(offsetl:while (inatruction.next !- instr) // find previous node in listinstruction instruction.next;offset instruction.length(); // offset of last element) elseoffset--;if (offset . ■ 0)return;// go down the tree to the rightmost node of the treewhile ((instruction.description(offset) < is_number) &&(instruction.get_node_at_pos(offset) ). null)) (// go down the treeinstruction - instruction.get_node_at_pos(offset);while linstruction.offset .. 0)// find last node in listinstruction instruction.next;offset - instruction.length();// offset of last elementKarelTheRobot.java
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: Implementierung des Interpreters•
Page 121 and 122: Printed by andi from a0.complang.tu
Page 129 and 130: power but retain the disciplined vi
Page 131 and 132: I- be reached from the present curs
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?