CASL II revision revision02 Copyright c Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution
|
|
|
- えつと なつ
- 5 years ago
- Views:
Transcription
1 CASL II revision02
2 CASL II revision revision02 Copyright c Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution 2.1 Japan License.
3 3 1 CASL II CASL II CASL II COMET II COMET II COMET II CPU CASL II START
4 DC DC DS DS DS DS DREG DMEM LD LD LD ST ST ST LAD LAD LAD COMET II CASL II LAD
5 5 4.3 ADDA ADDA ADDA ADDL ADDL ADDL SUBA SUBA SUBA SUBL SUBL SUBL CPA CPA CPL CPL AND AND OR OR XOR XOR
6 SLL SLL SRL SRL SLA SLA SRA SRA CALL CALL CALL
7 PUSH POP PUSH POP PUSH POP IN IN IN OUT OUT OUT RPUSH RPOP RPUSH RPOP RPUSH RPOP SVC NOP
8 A 94 B
9 9 1 CASL II Fortran COBOL Lisp Pascal Basic C AWK Smalltalk ML Prolog Perl PostScript Tcl Java Ruby (machine language) (language processor) (processor) (compiler) (interpreter)
10 10 1 CASL II (assembler language) 1 (instruction) LD GR4,GR (assemble) (assembler) (source code) (object code) (hand assenble) CASL II 7 3 C COBOL Java CASL II 4 1 (assembly language) 2 (mnemonic) 3 URL
11 1.3. COMET II 11 CASL II COMET II COMET II CASL II COMET II CASL II COMET II CASL II (CASL II assembler) CASL II CASL II COMET II CASL II CASL II COMET II CASL II COMET II COMET II (COMET II simulator) CASL II CASL II COMET II CASL II CASL II CASL II CASL II CASL II 1.3 COMET II COMET II CASL II COMET II CASL II COMET II COMET II (von Neumann architecture) stored program method sequential control method (primary memory) (word) COMET II COMET II (address) 0 0 1
12 12 1 CASL II 2 COMET II (bit) COMET II 16 COMET II COMET II COMET II JIS X COMET II 1 1 COMET II 16 JIS X COMET II A CPU CPU (central processing unit) CPU 3 ALU control unit arithmetic logic unit register COMET II CPU 4 general register GR COMET II
13 1.4. CASL II 13 8 GR GR GR0 GR1... GR7 16 flag register FR COMET II 1 FR 3 stack pointer SP COMET II 1 SP 16 program register PR COMET II 1 PR CASL II (instruction) (line) CASL II CASL II CASL II (operation code) (operand) (label) (comment)
14 14 1 CASL II CASL II 2 5 START OUT LD ST NOP NOP 1 NOP CASL II 36 CASL II (operand) NOP NOP CASL II 36 NOP LD NOP LD LD,
15 GR4,GR5 GR5 GR4 1 GR5 GR4 LD GR4,GR (address) 0 0 (label) GR0 GR7 A A1 KAMENOTE AC/DC ISOGINCHAKU 2F GR7 ( / ) (define) 1 HOGE LD GR4,GR5 HOGE LD COMET II
16 (comment) CASL II 1 LD GR4,GR5 1 ( ) NOP 0 ( ) CASL II 4 START DC DS START DC 2.3 DS START START CASL II START START START
17 START A START B START B A B START C START START C CASL II CASL II CASL II CASL II START START START CASL II CASL II (urn from subroutine) CASL II NOTHING START CASL II NOTHING START nothing.cas
18 18 2 CASL II.cas nothing.cas CASL II CASL II.obj nothing.cas NAME:NOTHING STARTadr:0000R SIZE: : : ( : ) CASL II COMET II CASL II (error) (error message) GET CASL II 2 error.cas ERROR START GET OP 2: GET 2 LB OP
19 2.3. DC 19 OD DC DC CASL II DC (Define Constant) DC DC DC DC DC DC (constant) DC decimal.cas DECIMAL START DC : :FFFF FFFF DC COMET II FFFF ( # )
20 20 2 #000F hexdec.cas HEXDEC START DC #000F :000F ( ) 1 ABC ABC COMET II 1 1 ABC 3 string.cas STRING START DC ABC 1 A 2 B 3 C 0001: : :0043 DC 2 fielder s choice fielder s choice NAMAKO 1 DC NAMAKO DC DC 1 address.cas ADDRESS START HUNDRED DC 100 DC HUNDRED 1
21 2.4. DS 21 DC 1 DC HUNDRED 2 DC HUNDRED : :0001R HUNDRED :0001R R R 0 (relative) DC 1 DC 1 DC,,... 2 (, ) DC 1 DC -1,#000F, ABC,HUNDRED DC -1 DC #000F DC ABC DC HUNDRED 4 DC sequence.cas SEQUENCE START HUNDRED DC 100 DC -1,#000F, ABC,HUNDRED 2.4 DS DS CASL II DS (Define Storage) DS DS DS DC
22 DS DS 0 10 DS DS DS 6 DS 6 ds.cas DS START DS 6 NAME:DS STARTadr:0000R SIZE: :8100 DS 6 3 SIZE: DS DS DS DS dslabel.cas DSLABEL START AREA DS 6 DC AREA : :0001R DS AREA 1 1 DS DS DS DS 0
23 LD (LoaD) ST (STore) LD LAD (Load ADdress) (dump) CASL II COMET II CASL II COMET II COMET II DREG DMEM CASL II COMET II
24 24 3 CASL II DREG DREG (Dump REGister) 8 DREG 8 DREG dreg.cas DREG START MESSAGE1 * MESSAGE1 * PR:0000 [ DREG ] FR:0(OF:0 SF:0 ZF:0) SP:F000 GR0:0000 GR1:0000 GR2:0000 GR3:0000 GR4:0000 GR5:0000 GR6:0000 GR7: DMEM DMEM (Dump MEMory) 8 DMEM DREG 8 DMEM dmem.cas DMEM START DMEM MSG,DUMPS,DUMPE DUMPS DC Hello, world! DUMPE DC -1 MESSAGE1 DUMPS DUMPE * MESSAGE1 * Start:000D End:001A 0008: C Hel 0010: 006C 006F 002C F C lo, worl 0018: FFFF d!. 3.3 LD LD LD (LoaD) LD LD,
25 3.4. ST HOGE GR5 GR5,HOGE ldgs.cas LDGS START LD GR5,HOGE HOGE DC #0F0F HOGE #0F0F GR5 DREG GR5 GR5:0F0F GR5 GR4 GR4,GR5 ldgg.cas LDGG START LD GR5,HOGE LD GR4,GR5 HOGE DC #0A0A HOGE #0A0A GR5 GR5 GR4 DREG GR4 GR5 GR4:0A0A GR5:0A0A 3.4 ST ST ST (STore) ST ST LD,
26 26 3 GR5 GEMO GR5,GEMO st.cas ST START LD GR5,HOGE ST GR5,GEMO DMEM MSG,HOGE,GEMO HOGE DC #0A0A GEMO DS 1 HOGE #0A0A GR5 GR5 GEMO HOGE GEMO DMEM HOGE #0A0A GEMO #0A0A 0A0A 0A0A 3.5 LAD LAD LAD (Load ADdress) LAD LAD, LAD 2.3 DC LAD lad.cas LAD START LAD GR3,-1 LAD GR4,#ABAB LAD GR5,HOGE HOGE DS 1 1 ( #FFFF ) GR3 #ABAB GR4 HOGE 9 GR5 DREG GR3:FFFF GR4:ABAB GR5:0009
27 (effective address) (address modification) (index register) COMET II COMET II GR1 GR7 GR CASL II CASL II ST GR3,HOGE ST HOGE CASL II ST GR3,HOGE,GR5 ST HOGE GR5 modify.cas MODIFY START DMEM MSG,HOGE,GEMO LAD GR3,#DADA LAD GR5,4 ST GR3,HOGE,GR5 DMEM MSG,HOGE,GEMO HOGE DC ABCDEFG GEMO DC -1 HOGE FFFF A G 1 ST #DADA ST HOGE GR5 GR DADA FFFF E #DADA LAD
28 28 4 LAD LAD,, ladmod.cas LADMOD START LAD GR5,4 LAD GR3,2,GR5 LAD 2 GR5 4 6 GR LAD LAD GR3,2,GR3 2 GR3 GR3 GR3 2 1 (increment) 1 (decrement) LAD LAD GR3,1,GR3 LAD GR3 LAD GR3,-1,GR3 LAD GR3 incdec.cas INCDEC START LAD GR3,4 LAD GR3,1,GR3 LAD GR3,-1,GR3 GR3 4 GR3 GR3 GR
29 CASL II ,, GR3,HOGE,GR5 GR3 HOGE GR5 GR3, GR3,HOGE GR3 HOGE GR3
30 30 4 1, GR3,GR4 GR3 GR4 GR CASL II 4 ADDA ADD Arithmetic ADDL ADD Logical SUBA SUBtract Arithmetic SUBL SUBtract Logical ADDA SUBA ADDL SUBL COMET II 1 flag register FR (flag) overflow flag OF (overflow) sign flag SF(sign) zero flag ZF 0 1 0
31 4.3. ADDA CASL II LD 14 ST LD ldsf.cas LDSF START LD GR5,HOGE HOGE DC #8000 HOGE #8000 GR5 DREG 1 FR:2(OF:0 SF:1 ZF:0) 1 ldzf.cas LDZF START LD GR5,HOGE HOGE DC 0 HOGE 0 GR5 DREG 0 FR:1(OF:0 SF:0 ZF:1) 1 LD ADDA ADDA ADDA (ADD Arithmetic) ADDA ADDA GR5,HOGE GR5 HOGE GR5 addags.cas ADDAGS START LAD GR5,-1
32 32 4 ADDA GR5,HOGE HOGE DC 3 GR5 1 GR5 HOGE DREG HOGE 3 2 GR5 GR5: ADDA ADDA GR3,GR4 GR3 GR4 GR3 addagg.cas ADDAGG START LAD GR3,10 LAD GR4,-2 ADDA GR3,GR4 GR3 10 GR4 2 GR3 GR4 DREG GR3 GR3: ADDA ADDA addaof.cas ADDAOF START LAD GR3,32767 LAD GR4,1 ADDA GR3,GR4 GR GR4 1 GR3 GR4 DREG FR:6(OF:1 SF:1 ZF:0) addasf.cas
33 4.4. ADDL 33 ADDASF START LAD GR3,2 LAD GR4,-3 ADDA GR3,GR4 GR3 2 GR4 3 GR3 GR4 DREG 1 1 FR:2(OF:0 SF:1 ZF:0) 1 addazf.cas ADDAZF START LAD GR3,3 LAD GR4,-3 ADDA GR3,GR4 GR3 3 GR4 3 GR3 GR4 DREG 0 FR:1(OF:0 SF:0 ZF:1) ADDL ADDL ADDL (ADD Logical) ADDL ADDL GR5,HOGE GR5 HOGE GR5 addlgs.cas ADDLGS START LAD GR5,4 ADDL GR5,HOGE HOGE DC 3 GR5 4 GR5 HOGE DREG HOGE 3 7 GR5
34 34 4 GR5: ADDL ADDL GR3,GR4 GR3 GR4 GR3 addlgg.cas ADDLGG START LAD GR3,32767 LAD GR4,1 ADDL GR3,GR4 GR GR4 1 GR3 GR4 DREG #8000 GR3 GR3: ADDL ADDL ADDL addlgs.cas 0 0 FR:0(OF:0 SF:0 ZF:0) addlgg.cas FR:2(OF:0 SF:1 ZF:0) COMET II 1 1 #8000 #FFFF addlof.cas ADDLOF START LAD GR3,65535 LAD GR4,1 ADDL GR3,GR4
35 4.5. SUBA 35 GR GR4 1 GR3 GR4 DREG FR:5(OF:1 SF:0 ZF:1) SUBA SUBA SUBA (SUB Arithmetic) SUBA SUBA GR5,HOGE GR5 HOGE GR5 subags.cas SUBAGS START LAD GR5,7 SUBA GR5,HOGE HOGE DC 3 GR5 7 GR5 HOGE DREG HOGE 3 4 GR5 GR5: SUBA SUBA GR3,GR4 GR3 GR4 GR3 subagg.cas SUBAGG START
36 36 4 LAD GR3,10 LAD GR4,2 SUBA GR3,GR4 GR3 10 GR4 2 GR3 GR4 DREG GR3 GR3: SUBA SUBA subaof.cas SUBAOF START LAD GR3, LAD GR4,1 SUBA GR3,GR4 GR GR4 1 GR3 GR4 DREG FR:4(OF:1 SF:0 ZF:0) 1 #7FFF subasf.cas SUBASF START LAD GR3,2 LAD GR4,3 SUBA GR3,GR4 GR3 2 GR4 3 GR3 GR4 DREG 1 1 FR:2(OF:0 SF:1 ZF:0) 1 subazf.cas SUBAZF START LAD GR3,3 LAD GR4,3 SUBA GR3,GR4 GR3 GR4 3 GR3 GR4 DREG 0
37 4.6. SUBL 37 FR:1(OF:0 SF:0 ZF:1) SUBL SUBL SUBL (SUB Logical) SUBL SUBL GR5,HOGE GR5 HOGE GR5 sublgs.cas SUBLGS START LAD GR5,7 SUBL GR5,HOGE HOGE DC 3 GR5 7 GR5 HOGE DREG HOGE 3 4 GR5 GR5: SUBL SUBL GR3,GR4 GR3 GR4 GR3 sublgg.cas SUBLGG START LAD GR3,10 LAD GR4,2 SUBL GR3,GR4 GR3 10 GR4 2 GR3 GR4 DREG GR3
38 38 5 GR3: SUBL SUBL sublof.cas SUBLOF START LAD GR3,0 LAD GR4,1 SUBL GR3,GR4 GR3 0 GR4 1 GR3 GR4 DREG 0 1 FR:6(OF:1 SF:1 ZF:0) 1 #FFFF CASL II CASL II 2 CPA ComPare Arithmetic CPL ComPare Logical CPA CPL
39 5.2. CPA SF > 0 0 = 0 1 < CPA CPA CPA (ComPare Arithmetic) cpa.cas CPA START LAD GR1,5 CPA GR1,A CPA GR1,B CPA GR1,C A DC 4 B DC 5 C DC CPA FR:0(OF:0 SF:0 ZF:0) CPA FR:1(OF:0 SF:0 ZF:1) CPA FR:2(OF:0 SF:1 ZF:0) 1 0 ZF
40 cpa2.cas CPA2 START LAD GR1,-5 CPA GR1,A CPA GR1,B LAD GR1, CPA GR1,C A DC -6 B DC 5 C DC CPA FR:0(OF:0 SF:0 ZF:0) CPA FR:2(OF:0 SF:1 ZF:0) CPA FR:2(OF:0 SF:1 ZF:0) SUBA CPA 5.3 CPL CPL CPL (ComPare Logical) cpl.cas CPL START LAD GR1,5 CPL GR1,A CPL GR1,B CPL GR1,C A DC 4 B DC 5
41 41 C DC CPL CPL SF ZF CPA CPL CPA CPL cpl2.cas CPL2 START LAD GR1,#FFFB CPL GR1,A CPL GR1,B A DC #FFFA B DC #0005 #FFFB #FFFA CPL FR:0(OF:0 SF:0 ZF:0) 0 0 #FFFB 5 #FFFA CPA CPL #FFFB #0005 CPL FR:0(OF:0 SF:0 ZF:0) 0 0 #FFFB 5 CPL CPA 1 0 CPL CPA
42 42 6 CASL II CASL II CASL II 3 AND AND OR OR XOR exclusive OR AND AND AND A B A B A B
43 6.2. AND and.cas AND START LAD GR1,#00FF AND GR1,HOGE HOGE DC #0F0F GR1 #00FF GR1 HOGE DREG HOGE #0F0F #000F GR1 GR1:000F (mask processing) (mask) mask.cas MASK START LAD GR1,#A6A6 AND GR1,HOGE HOGE DC #00FF #A6A #00A6
44 OR OR OR A B A B A B or.cas OR START LAD GR1,#00FF OR GR1,HOGE HOGE DC #0F0F GR1 #00FF GR1 HOGE DREG HOGE #0F0F #0FFF GR1 GR1:0FFF
45 6.4. XOR turnon.cas TURNON START LAD GR1,#A6A6 OR GR1,HOGE HOGE DC #00FF #A6A6 8 #A6FF 6.4 XOR XOR XOR (exclusive OR) A B A B A B xor.cas XOR START LAD GR1,#00FF
46 46 6 XOR GR1,HOGE HOGE DC #0F0F GR1 #00FF GR1 HOGE DREG HOGE #0F0F #0FF0 GR1 GR1:0FF not.cas NOT START LAD GR1,#A6A6 XOR GR1,HOGE HOGE DC #00FF #A6A6 8 #A COMET II 2 (1) (2)
47 invert.cas INVERT START LAD GR1,6 XOR GR1,ALLONE LAD GR1,1,GR1 XOR GR1,ALLONE LAD GR1,1,GR1 ALLONE DC #FFFF GR1 6 XOR LAD DREG GR1 GR1:FFFA 6 6 DREG GR1 GR1: SRA = 20
48 = 5 n 2 n n 2 n 1 CASL II CASL II 4 SLL Shift Left Logical SRL Shift Right Logical SLA Shift Left Arithmetic SRA Shift Right Arithmetic SLL SRL SLA SRA CASL II , GR3,5 GR3 5,, GR1 3 GR3,5,GR1 GR
49 7.2. SLL SLL SLL SLL (Shift Left Logical) 2 n SLL SLL sll.cas SLL START LAD GR1,#0801 SLL GR1,4 GR1 # DREG GR1 GR1: = 16 # # SRL SRL SRL (Shift Right Logical) 2 n 1 SRL SRL srl.cas SRL START LAD GR1,#8000 SRL GR1,4 GR1 # DREG GR1 GR1:0800
50 # # SLA SLA SLA (Shift Left Arithmetic) 15 SLA 2 n SLA SLA sla.cas SLA START LAD GR1,#000A SLA GR1,4 GR1 #000A 4 DREG GR1 GR1:00A = 16 #000A #00A sla2.cas SLA2 START LAD GR1,#4001 SLA GR1,1 GR1 # DREG # SLA GR1 GR1:0002 SLA SLL SLL # #8002 SLA 14 1
51 7.5. SRA 51 SLA 1 FR:4(OF:1 SF:0 ZF:0) SLA sla3.cas SLA3 START LAD GR1,#FFF6 SLA GR1,4 GR1 #FFF6 4 DREG GR1 GR1:FF = 16 #FFF #FF SLA 1 FR:6(OF:1 SF:1 ZF:0) sla4.cas SLA4 START LAD GR1,#8001 SLA GR1,1 GR1 # DREG # SLA GR1 GR1: SRA SRA SRA (Shift Right Arithmetic) 15 SRA
52 SRA SRA 2 n 1 SRA SRA sra.cas SRA START LAD GR1,#00A0 SRA GR1,4 GR1 #00A0 4 DREG GR1 GR1:000A #00A #000A SRA sra2.cas SRA2 START LAD GR1,#FF60 SRA GR1,4 GR1 #FF60 4 DREG GR1 GR1:FFF #FF #FFF SRA SRL SRL 0 #FF60 4 #0FF6 SRA #FFF6 8
53 CPU (PR) CASL II 6 JPL Jump on PLus JMI Jump on MInus JNZ Jump on Non Zero JZE Jump on ZEro JOV Jump on OVerflow JUMP unconditional JUMP JUMP JUMP OF SF ZF JPL 0 0 JMI 1 JNZ 0 JZE 1 JOV JPL 0 0 JMI JNZ HOGE
54 HOGE, JZE HOGE,GR5 1 HOGE GR (loop) (iteration) (infinite loop) infinite.cas INFINITE START LOOP JUMP LOOP DREG LOOP LOOP DREG LOOP C JUMP downto.cas DOWNTO START LAD GR1,10 LOOP SUBA GR1,ONE
55 JPL LOOP ONE DC 1 GR1 10 GR1 1 DREG JPL LOOP JPL 0 0 GR1 1 FR:0(OF:0 SF:0 ZF:0) LOOP GR FR:1(OF:0 SF:0 ZF:1) upto.cas UPTO START LAD GR1,0 LOOP ADDA GR1,ONE CPA GR1,TEN JMI LOOP ONE DC 1 TEN DC 10 GR1 0 GR1 1 GR1 10 DREG JMI LOOP JMI 1 GR1 10 FR:2(OF:0 SF:1 ZF:0) LOOP GR GR1 10 FR:1(OF:0 SF:0 ZF:1)
56 ldseq.cas LDSEQ START LAD GR2,0 LOOP LD GR1,DATA,GR2 LAD GR2,1,GR2 CPA GR2,LENGTH JMI LOOP LENGTH DC 7 DATA DC 6,3,2,7,8,9,4 GR2 0 DATA GR2 GR1 DREG GR2 GR2 LENGTH 7 GR DATA 7 GR sum.cas SUM START LAD GR1,0 LAD GR2,0 LOOP ADDA GR1,DATA,GR2 LAD GR2,1,GR2 CPA GR2,LENGTH JMI LOOP LENGTH DC 7 DATA DC 6,3,2,7,8,9,4
57 GR1 GR2 0 DATA GR2 GR1 GR2 GR2 DREG GR1 GR1: twice.cas TWICE START LAD GR2,0 LOOP LD GR1,DATA,GR2 SLA GR1,1 ST GR1,RESULT,GR2 LAD GR2,1,GR2 CPA GR2,LENGTH JMI LOOP DMEM MSG,DATA,DUMPE LENGTH DC 7 DATA DC 6,3,2,7,8,9,4 RESULT DS 7 DUMPE DC -1 GR2 0 DATA GR2 GR1 1 RESULT GR2 GR2 GR2 DATA DUMPE DMEM DATA DC RESULT 000C E DATA
58 JNZ SKIP JNZ SKIP 0 zero.cas ZERO START LAD GR1,0 LAD GR2,0 LOOP LD GR3,DATA,GR2 JNZ SKIP LAD GR1,1,GR1 SKIP LAD GR2,1,GR2 CPA GR2,LENGTH JMI LOOP LENGTH DC 12 DATA DC 0,3,0,0,-2,0,1,0,0,-5,0, GR1 GR1 GR1: GR3 0 GR1 0 0 JNZ A B 0 SKIP1 SKIP2 JNZ SKIP1 0 JUMP SKIP2 0 evenodd.cas EVENODD START LAD GR2,0 LOOP LD GR1,DATA,GR2 AND GR1,MASK JNZ SKIP1
59 59 LAD GR3,#8888 JUMP SKIP2 SKIP1 LAD GR3,#1111 SKIP2 ST GR3,RESULT,GR2 LAD GR2,1,GR2 CPA GR2,LENGTH JMI LOOP DMEM MSG,DATA,DUMPE MASK DC #0001 LENGTH DC 7 DATA DC 2,11,3,12,6,7,14 RESULT DS 7 DUMPE DC -1 7 #8888 #9999 #8888 # #0001 #0000 #0001 DATA DUMPE DMEM DATA B C E DC RESULT DATA #8888 # (subroutine) (call) (main routine)
60 CASL II 4 CALL CALL urn from subroutine PUSH PUSH POP POP 9.2 CALL CALL (call) CALL (PR) CALL JUMP CALL CALL CALL CALL CALL CALL CALL HOGE HOGE CALL CALL, CALL HOGE,GR5 HOGE GR5
61 CALL CALL (PR) OS CALL CALL callret.cas CALL START M CALL SUB M MSGM DC MAINROUT SUB S MSGS DC SUBROUTI 3 MAINROUT CALL DREG SUBROUTI SUB DREG SUB DREG * StackAreaDump * Start:EFFF End:EFFF EFF8: (stack) (push) (pop)
62 62 9 A B C D E E D C B A E D C B A COMET II stack pointer SP COMET II (1) (2) (1) (2) CALL CALL CALL A B B C C D D E A B C D E A B C D A B C D E DREG OS
63 9.4. PUSH POP 63 DREG 3 2 DREG SUB DREG DREG * StackAreaDump * Start:EFFF End:EFFF EFF8: #EFF8 #EFFF #EFFF CALL # PUSH POP PUSH POP CALL COMET II CALL COMET II PUSH POP PUSH PUSH PUSH PUSH #2FA3 #2FA3 PUSH PUSH, PUSH 6,GR5 6 GR5 0, PUSH 0,GR5 GR POP POP
64 64 10 POP POP GR1 GR1 pushpop.cas PUSHPOP START PUSH #7777 LAD GR5,#8888 PUSH 0,GR5 POP GR1 POP GR1 DREG #7777 #8888 #7777 PUSH #8888 PUSH PUSH POP refuge.cas REFUGE START LAD GR1,#1111 LAD GR2,#2222 M PUSH 0,GR2 CALL SUB POP GR2 M MSGM DC MESSAGE1 SUB LAD GR1,#FFFF LAD GR2,#AAAA GR1 #1111 GR2 #2222 SUB GR1 #FFFF GR2 #AAAA GR1 #1111 GR2 #
65 CASL II CASL II IN INput OUT OUTput RPUSH Register PUSH RPOP Register POP 10.2 IN IN COMET II COMET II 1 1 (record) IN 1 IN IN IN IN IN 1 (end of file, EOF) IN IN IN 1, 2 1 2
66 66 10 IN INAREA,INLENGTH IN INAREA INLENGTH in.cas IN START IN INAREA,INLENGTH DMEM MSG,INAREA,DUMPE INAREA DS 256 INLENGTH DS 1 DUMPE DC -1 IN DMEM IN? I love CASL II. 0008: C 006F I love C 0010: C E 0000 ASL II.. MESSAGE1 000F #000F OUT OUT OUT 1 OUT OUT OUT COMET II A OUT A OUT
67 10.4. RPUSH RPOP OUT OUT 1, OUT OUTAREA,OUTLENGT OUT OUTAREA OUTLENGT out.cas OUT START OUT OUTAREA,OUTLENGT OUTAREA DC I love CASL II. OUTLENGT DC 15 OUT I love CASL II RPUSH RPOP RPUSH RPOP 9.4 PUSH POP RPUSH RPOP GR0 RPUSH RPOP RPUSH RPUSH GR1 GR2 GR3... GR7 RPUSH PUSH PUSH PUSH PUSH PUSH PUSH PUSH 0,GR1 0,GR2 0,GR3 0,GR4 0,GR5 0,GR6 0,GR RPOP RPOP GR7 GR6 GR5... GR1 RPOP POP POP POP POP POP POP POP GR7 GR6 GR5 GR4 GR3 GR2 GR1
68 68 10 rpushpop.cas RPUSHPOP START LAD GR1,#1111 LAD GR2,#2222 LAD GR3,#3333 LAD GR4,#4444 LAD GR5,#5555 LAD GR6,#6666 LAD GR7,#7777 M RPUSH CALL SUB RPOP M MSGM DC MESSAGE1 SUB LAD GR1,#FFFF LAD GR2,#EEEE LAD GR3,#DDDD LAD GR4,#CCCC LAD GR5,#BBBB LAD GR6,#AAAA LAD GR7,#9999 S MSGS DC MESSAGE2 GR1 GR7 RPUSH SUB GR1 GR7 RPOP CASL II SVC NOP SVC NOP SVC SVC (SuperVisor Call) OS SVC OS SVC 38 SVC 38 OS SVC IN OUT IN OUT SVC NOP NOP (No OPeration)
69 NOP HOGE NOP GAMO LAD GR0,31 GR0 31 HOGE GAMO NOP HOGE GAMO CASL II = =538 =#F60A = A DC LD GR1,=3 LD =3 DC 3 DC DC DC LD GR1,=3 LD DC GR1 3 GR1 literal.cas LITERAL START LD GR0,=3 LD GR1,=#CDEF LD GR2,= A GR0 GR1 GR2 DREG GR0 GR1 GR GR0:0003 GR1:CDEF GR2:0041
70 COMET II iteradd.cas ITERADD START LAD GR0,0 LD GR1,B JMI EXIT LOOP JZE EXIT ADDA GR0,A SUBA GR1,=1 JUMP LOOP EXIT ST GR0,PRODUCT DMEM MSG,PRODUCT,DUMPE A DC 3 B DC 7 PRODUCT DS 1 DUMPE DC -1 A B PRODUCT DMEM PRODUCT A 3 B 7 PRODUCT #
71 itersub.cas ITERSUB START LAD GR0,0 LD GR1,A LOOP CPA GR1,B JMI EXIT SUBA GR1,B ADDA GR0,=1 JUMP LOOP EXIT ST GR0,QUOTIENT ST GR1,MOD DMEM MSG,QUOTIENT,DUMPE A DC 34 B DC 7 QUOTIENT DS 1 MOD DS 1 DUMPE DC -1 A B QUOTIENT MOD DMEM QUOTIENT MOD A 34 B 7 QUOTIENT 4 MOD (26 9) (26) (9) (234) mulpape.cas MULPAPE START LAD GR0,0 LD GR1,A LD GR2,B LOOP JZE EXIT LD GR3,GR2 AND GR3,=#0001 JZE SKIP ADDL GR0,GR1
72 72 11 SKIP SLL GR1,1 SRL GR2,1 JUMP LOOP EXIT ST GR0,PRODUCT DMEM MSG,PRODUCT,DUMPE A DC 26 B DC 9 PRODUCT DS 1 DUMPE DC -1 A B PRODUCT DMEM PRODUCT A 26 B 9 PRODUCT #00EA GR0 0 GR1 GR2 GR1 GR2 1 GR2 1 GR1 GR0 GR (51 9) ) divpape.cas DIVPAPE START LD GR1,A LD GR2,B LAD GR3,#0001 LOOP1 CPA GR1,GR2 JMI EXIT SLL GR2,1 SLL GR3,1 JUMP LOOP1 EXIT LAD GR4,0 LOOP2 CPA GR1,GR2 JMI SKIP ADDA GR4,GR3 SUBA GR1,GR2
73 73 SKIP SRL GR2,1 SRL GR3,1 CPA GR1,B JPL LOOP2 JZE LOOP2 ST GR4,QUOTIENT ST GR1,MOD DMEM MSG,QUOTIENT,DUMPE A DC 51 B DC 9 QUOTIENT DS 1 MOD DS 1 DUMPE DC -1 A B QUOTIENT MOD DMEM QUOTIENT MOD A 51 B 9 QUOTIENT 5 MOD 6 LOOP1 LOOP2 LOOP1 (GR2) (GR1) (GR2) 1 GR3 # LOOP2 (GR2) 1 (GR3) 1 1 GR4 GR3 (GR1) (GR2) (GR1) GR2 B COMET II reverse.cas REVERSE START IN INAREA,INLENGTH CALL REVSUB OUT OUTAREA,INLENGTH REVSUB LAD GR2,0 LD GR3,INLENGTH LAD GR3,-1,GR3 LOOP LD GR1,INAREA,GR2 ST GR1,OUTAREA,GR3 LAD GR2,1,GR2 LAD GR3,-1,GR3 CPA GR2,INLENGTH
74 74 12 JMI LOOP INAREA DS 256 INLENGTH DS 1 OUTAREA DS 256 IN INAREA INLENGTH REVSUB OUTAREA OUT REVSUB GR2 (0) GR3 1 INAREA GR2 GR1 OUTAREA GR3 GR2 INLENGTH IN? I am a cat..tac a ma I sp2dot.cas SP2DOT START IN INAREA,INLENGTH CALL S2DSUB OUT OUTAREA,INLENGTH S2DSUB LAD GR2,0 LOOP LD GR1,INAREA,GR2 CPL GR1,= JPL SKIP JMI SKIP LD GR1,=. SKIP ST GR1,OUTAREA,GR2 LAD GR2,1,GR2 CPA GR2,INLENGTH JMI LOOP INAREA DS 256 INLENGTH DS 1 OUTAREA DS 256 S2DSUB GR2 0 INAREA GR2 0 GR1 GR1 GR1 OUTAREA GR2 GR2 INLENGTH IN? dog cat mouse rabbit monkey dog..cat...mouse...rabbit...monkey
75 COMET II JIS X 0201 JIS X 0201 A B C D a b c d low2up.cas LOW2UP START IN INAREA,INLENGTH CALL L2USUB OUT OUTAREA,INLENGTH L2USUB LAD GR2,0 LOOP LD GR1,INAREA,GR2 CALL ISLOWER CPL GR3,=0 JZE SKIP SUBL GR1,=32 SKIP ST GR1,OUTAREA,GR2 LAD GR2,1,GR2 CPA GR2,INLENGTH JMI LOOP ISLOWER LAD GR3,0 CPL GR1,= a JMI EXIT CPL GR1,= z JPL EXIT LAD GR3,1 EXIT INAREA DS 256 INLENGTH DS 1 OUTAREA DS 256 ISLOWER GR1 GR3 1 0 IN? Arithmetic Logic Unit ARITHMETIC LOGIC UNIT acronym.cas ACRONYM START IN INAREA,INLENGTH CALL ACROSUB OUT OUTAREA,OUTLENGT
76 76 12 ACROSUB LAD GR2,0 LAD GR3,0 LOOP LD GR1,INAREA,GR2 CALL ISUPPER CPL GR4,=0 JZE SKIP ST GR1,OUTAREA,GR3 LAD GR3,1,GR3 SKIP LAD GR2,1,GR2 CPA GR2,INLENGTH JMI LOOP ST GR3,OUTLENGT ISUPPER LAD GR4,0 CPL GR1,= A JMI EXIT CPL GR1,= Z JPL EXIT LAD GR4,1 EXIT INAREA DS 256 INLENGTH DS 1 OUTAREA DS 256 OUTLENGT DS 1 IN? Arithmetic Logic Unit ALU (substring) (string searching) head.cas HEAD START IN INAREA1,INLEN1 IN INAREA2,INLEN2 CALL HEADSUB DMEM MSG,RESULT,DUMPE HEADSUB LD GR1,INLEN1 CPL GR1,INLEN2 JMI NOTFOUND LAD GR1,0 LOOP LD GR2,INAREA1,GR1 CPL GR2,INAREA2,GR1 JPL NOTFOUND JMI NOTFOUND LAD GR1,1,GR1 CPA GR1,INLEN2 JMI LOOP LAD GR0,0 JUMP FOUND NOTFOUND LAD GR0,-1 FOUND ST GR0,RESULT
77 INAREA1 DS 256 INLEN1 DS 1 INAREA2 DS 256 INLEN2 DS 1 RESULT DS 1 DUMPE DC RESULT DMEM RESULT 1 2 HEADSUB RESULT RESULT 2 0 RESULT IN? assembler IN? assem * MESSAGE1 * Start:022E End:022F 0228: FFFF.. IN? assembler IN? assym * MESSAGE1 * Start:022E End:022F 0228: FFFF FFFF.. IN? assembler IN? assemblers * MESSAGE1 * Start:022E End:022F 0228: FFFF FFFF charsch.cas CHARSCH START IN INAREA1,INLEN1 IN INAREA2,INLEN2 CALL CHARSCHS DMEM MSG,RESULT,DUMPE CHARSCHS LD GR1,INLEN2 CPA GR1,=1 JMI NOTFOUND LAD GR1,0 LOOP LD GR2,INAREA1,GR1 CPL GR2,INAREA2 JZE FOUND LAD GR1,1,GR1 CPA GR1,INLEN1 JMI LOOP NOTFOUND LAD GR1,-1 FOUND ST GR1,RESULT INAREA1 DS 256 INLEN1 DS 1
78 78 12 INAREA2 DS 256 INLEN2 DS 1 RESULT DS 1 DUMPE DC RESULT DMEM RESULT 1 2 CHARSCHS RESULT 2 1 RESULT 1 1 RESULT IN? assembler IN? mouse * MESSAGE1 * Start:0228 End: : 0004 FFFF IN? assembler IN? cat * MESSAGE1 * Start:0228 End: : FFFF FFFF search.cas SEARCH START IN INAREA1,INLEN1 IN INAREA2,INLEN2 CALL SEARCHS DMEM MSG,RESULT,DUMPE SEARCHS LD GR1,INLEN2 CPA GR1,=1 JMI NOTFD1 LD GR1,INLEN1 SUBL GR1,INLEN2 JMI NOTFD1 LAD GR1,1,GR1 ST GR1,INLEN3 LAD GR1,0 LOOP1 LD GR2,INAREA1,GR1 CPL GR2,INAREA2 JPL SKIP JMI SKIP CALL HEADSUB CPL GR3,=0 JZE FOUND1 SKIP LAD GR1,1,GR1 CPA GR1,INLEN3 JMI LOOP1 NOTFD1 LAD GR1,-1 FOUND1 ST GR1,RESULT HEADSUB LD GR4,INLEN2 CPL GR4,=2
79 JMI FOUND2 ADDL GR4,GR1 ADDL GR4,INLEN2 CPL GR4,INLEN1 JPL NOTFD2 LAD GR4,1,GR1 LAD GR5,1 LOOP2 LD GR6,INAREA1,GR4 CPL GR6,INAREA2,GR5 JPL NOTFD2 JMI NOTFD2 LAD GR4,1,GR4 LAD GR5,1,GR5 CPA GR5,INLEN2 JMI LOOP2 FOUND2 LAD GR3,0 NOTFD2 LAD GR3,-1 INAREA1 DS 256 INLEN1 DS 1 INAREA2 DS 256 INLEN2 DS 1 INLEN3 DS 1 RESULT DS 1 DUMPE DC RESULT DMEM RESULT 1 2 SEARCHS RESULT RESULT HEADSUB GR3 GR3 0 RESULT 0 HEADSUB RESULT 2 1 GR3 2 0 GR COMET II 2 2 int2bin.cas
80 80 12 INT2BIN START LD GR0,INTEGER LAD GR1,15 LOOP SRL GR0,1 JOV SKIP1 LD GR2,= 0 JUMP SKIP2 SKIP1 LD GR2,= 1 SKIP2 ST GR2,BINARY,GR1 LAD GR1,-1,GR1 CPA GR1,=-1 JPL LOOP OUT BINARY,LENGTH INTEGER DC #39CE BINARY DS 16 LENGTH DC 16 INTEGER #39CE BINARY GR1 0 1 GR0 1 JOV int2hex.cas INT2HEX START LD GR0,INTEGER LAD GR1,3 LOOP LD GR2,GR0 AND GR2,=#000F CPL GR2,=10 JMI SKIP1 ADDL GR2,=55 JUMP SKIP2 SKIP1 ADDL GR2,=48 SKIP2 ST GR2,HEXDEC,GR1 SRL GR0,4 LAD GR1,-1,GR1 CPA GR1,=-1 JPL LOOP OUT HEXDEC,LENGTH INTEGER DC #39CE HEXDEC DS 4 LENGTH DC 4 INTEGER #39CE 16 39CE
81 JIS X A B C D E F JIS X 0201 A B C D int2dec.cas INT2DEC START LD GR0,INTEGER LAD GR1,0 LOOP1 CALL DIVIDE ADDL GR2,=48 ST GR2,DECIMAL,GR1 LAD GR1,1,GR1 CPA GR1,=4 JMI LOOP1 ADDL GR0,=48 ST GR0,DECIMAL,GR1 OUT DECIMAL,LENGTH DIVIDE LAD GR2,0 LOOP2 CPA GR0,WEIGHT,GR1 JMI EXIT LAD GR2,1,GR2 SUBL GR0,WEIGHT,GR1 JUMP LOOP2 EXIT INTEGER DC #39CE WEIGHT DC 10000,1000,100,10 DECIMAL DS 5 LENGTH DC 5 INTEGER #39CE WEIGHT LOOP DECIMAL 10 0 DIVIDE GR0 GR2
82 bin2int.cas BIN2INT START IN INAREA,INLENGTH CALL B2ISUB DMEM MSG,INTEGER,DUMPE B2ISUB LAD GR0,0 LAD GR1,0 LOOP SLL GR0,1 LD GR2,INAREA,GR1 CPL GR2,= 0 JZE SKIP OR GR0,=#0001 SKIP LAD GR1,1,GR1 CPL GR1,INLENGTH JMI LOOP ST GR0,INTEGER INAREA DS 256 INLENGTH DS 1 INTEGER DS 1 DUMPE DC -1 2 DMEM B2ISUB INAREA 2 INTEGER LOOP GR GR0 #0001 GR0 0 1 IN? * MESSAGE1 * Start:0122 End: : BD6 FFFF hex2int.cas HEX2INT START IN INAREA,INLENGTH CALL H2ISUB DMEM MSG,INTEGER,DUMPE H2ISUB LAD GR0,0 LAD GR1,0 LOOP SLL GR0,4 LD GR2,INAREA,GR1 CALL HEXVAL OR GR0,GR2 LAD GR1,1,GR1 CPL GR1,INLENGTH JMI LOOP ST GR0,INTEGER
83 HEXVAL CPL GR2,= A JMI SKIP1 SUBL GR2,=55 JUMP SKIP2 SKIP1 SUBL GR2,=48 SKIP2 INAREA DS 256 INLENGTH DS 1 INTEGER DS 1 DUMPE DC DMEM H2ISUB INAREA 16 INTEGER LOOP GR GR0 GR0 HEXVAL GR2 16 GR2 IN? BD6 * MESSAGE1 * Start:012A End:012B 0128: BD6 FFFF dec2int.cas DEC2INT START IN INAREA,INLENGTH CALL D2ISUB DMEM MSG,INTEGER,DUMPE D2ISUB LAD GR0,0 LAD GR1,0 LOOP1 CALL TENTIMES LD GR2,INAREA,GR1 SUBL GR2,=48 ADDL GR0,GR2 LAD GR1,1,GR1 CPL GR1,INLENGTH JMI LOOP1 ST GR0,INTEGER TENTIMES LAD GR3,0 LD GR4,GR0 LOOP2 ADDL GR0,GR4 LAD GR3,1,GR3 CPL GR3,=9 JMI LOOP2 INAREA DS 256 INLENGTH DS 1 INTEGER DS 1 DUMPE DC -1
84 DMEM D2ISUB INAREA 10 INTEGER LOOP GR GR0 GR0 TENTIMES GR0 10 GR0 IN? 3030 * MESSAGE1 * Start:012A End:012B 0128: BD6 FFFF (recursion) (recursive) (basis)
85 recurse.cas RECURSE START LAD GR1,4 CALL RECSUB RECSUB CPL GR1,=0 JZE BASIS PUSH 0,GR1 LAD GR1,-1,GR1 CALL RECSUB POP GR1 BASIS GR1 4 RECSUB RECSUB RECSUB RECSUB GR1 GR1 GR1 GR1 0 GR1 0 RECSUB DREG GR DREG DREG GR { a 0 = 0 b 1 a b = a + (a (b 1)) mulrecu.js MULRECU START LD GR1,A
86 86 13 LD GR2,B CALL MULSUB ST GR0,PRODUCT DMEM MSG,PRODUCT,DUMPE MULSUB CPL GR2,=0 JZE BASIS PUSH 0,GR2 LAD GR2,-1,GR2 CALL MULSUB POP GR2 ADDL GR0,GR1 BASIS LAD GR0,0 A DC 26 B DC 9 PRODUCT DS 1 DUMPE DC -1 A B PRODUCT DMEM PRODUCT A 26 B 9 PRODUCT #00EA GR1 GR2 MULSUB MULSUB GR1 GR2 GR n 0 n 1 n (n 1) (n 2)... 1 n (factorial) n! 0! 1 5! { 0! = 1 n 1 n! = n (n 1)! fact.cas FACT START LD GR1,N CALL FACTSUB ST GR0,FACTORI DMEM MSG,FACTORI,DUMPE FACTSUB CPL GR1,=0 JZE BASIS PUSH 0,GR1
87 LAD GR1,-1,GR1 CALL FACTSUB POP GR1 CALL MULTIPLY BASIS LAD GR0,1 MULTIPLY LAD GR3,0 LD GR2,GR0 LOOP CPL GR2,=0 JZE EXIT ADDL GR3,GR1 LAD GR2,-1,GR2 JUMP LOOP EXIT LD GR0,GR3 N DC 5 FACTORI DS 1 DUMPE DC -1 N FACTORI DMEM FACTORI N 5 FACTORI #0078 GR1 FACTSUB FACTSUB GR1 GR0 MULTIPLY GR0 GR1 GR (Fibonacci sequence) 0 14 n n n (F n ) F 0 = 0 F 1 = 1 n 2 F n = F n 2 + F n fibona.cas FIBONA START LD GR1,N CALL FIBOSUB ST GR2,NTHTERM DMEM MSG,NTHTERM,DUMPE FIBOSUB CPL GR1,=0 JZE BASIS0
88 88 13 CPL GR1,=1 JZE BASIS1 PUSH 0,GR1 LAD GR1,-1,GR1 CALL FIBOSUB PUSH 0,GR2 LAD GR1,-1,GR1 CALL FIBOSUB LD GR3,GR2 POP GR2 POP GR1 ADDL GR2,GR3 BASIS0 LAD GR2,0 BASIS1 LAD GR2,1 N DC 14 NTHTERM DS 1 DUMPE DC -1 N NTHTERM DMEM NTHTERM N 14 NTHTERM #0179 GR1 FIBOSUB FIBOSUB GR1 GR n m n m n m (greatest common measure, GCM) n m (Euclidean algorithm) n m n n m n m n m d m d n m m n m n d n d n m gcm.cas GCM START LD GR1,N LD GR2,M CALL GCMSUB ST GR3,GCMRES DMEM MSG,GCMRES,DUMPE GCMSUB CPL GR1,GR2 JZE BASIS JMI SKIP1 SUBL GR1,GR2 JUMP SKIP2 SKIP1 SUBL GR2,GR1
89 SKIP2 CALL GCMSUB BASIS LD GR3,GR1 N DC 54 M DC 36 GCMRES DS 1 DUMPE DC -1 N M GCMRES DMEM GCMRES N 54 M 36 GCMRES #0012 GR1 GR2 GCMSUB GCMSUB GR1 GR2 GR n n 10 n n 10 n 0 n 10 0 n inttod.cas INTTOD START LD GR1,INTEGER LAD GR2,4 CALL I2DSUB OUT DECIMAL,LENGTH I2DSUB CPL GR1,=0 JZE BASIS CALL DIVTEN ADDL GR3,=48 ST GR3,DECIMAL,GR2 LAD GR2,-1,GR2 CALL I2DSUB BASIS DIVTEN LAD GR4,0 LOOP CPA GR1,=10 JMI EXIT LAD GR4,1,GR4 SUBL GR1,=10 JUMP LOOP EXIT LD GR3,GR1 LD GR1,GR4
90 90 13 INTEGER DC #39CE DECIMAL DC LENGTH DC 5 INTEGER #39CE GR1 GR2 4 I2DSUB 10 DECIMAL OUT GR2 DECIMAL I2DSUB GR1 10 DIVTEN GR1 10 GR1 GR dtoint.cas DTOINT START IN INAREA,INLENGTH LD GR1,INLENGTH LAD GR1,-1,GR1 CALL D2ISUB ST GR2,INTEGER DMEM MSG,INTEGER,DUMPE D2ISUB CPA GR1,=-1 JZE BASIS PUSH 0,GR1 LAD GR1,-1,GR1 CALL D2ISUB POP GR1 CALL TENTIMES LD GR3,INAREA,GR1 SUBL GR3,=48 ADDL GR2,GR3 BASIS LAD GR2,0 TENTIMES LAD GR4,0 LD GR5,GR2 LOOP ADDL GR2,GR5 LAD GR4,1,GR4 CPL GR4,=9
91 A B C A B C 13.1: JMI LOOP INAREA DS 256 INLENGTH DS 1 INTEGER DS 1 DUMPE DC DMEM 10 GR1 D2ISUB 10 GR2 INTEGER DMEM GR1 10 INAREA D2ISUB INAREA 10 GR2 TENTIMES GR2 10 IN? 3030 * MESSAGE1 * Start:0132 End: : BD6 FFFF (Tower of Hanoi)
92 (n 3) (n 2) (n 1) n 13.2: A C 1 1 n 13.2 n (n 1) (n 2) (n 3) 1 n 1 n n n (n 1) 3 3 n n n (n 1) A B C (n 1) n (n 1) 13.3 n 0 0 n 0
93 (n 1) n 1 n (n 1) 2 (n 1) n 3 (n 1) n 13.3: hanoi.cas HANOI START LD GR1,N LD GR2,= A LD GR3,= B LD GR4,= C CALL HANOISUB HANOISUB CPL GR1,=0 JZE BASIS PUSH 0,GR1 PUSH 0,GR2 PUSH 0,GR3 PUSH 0,GR4 LAD GR1,-1,GR1 LD GR5,GR3 LD GR3,GR4 LD GR4,GR5 CALL HANOISUB POP GR4 POP GR3 POP GR2
94 94 A CALL MOVE PUSH 0,GR2 PUSH 0,GR3 PUSH 0,GR4 LD GR5,GR2 LD GR2,GR3 LD GR3,GR5 CALL HANOISUB POP GR4 POP GR3 POP GR2 POP GR1 BASIS MOVE ST GR2,SRC ST GR4,DEST OUT SRC,LENGTH N DC 3 SRC DS 1 DC -> DEST DS 1 LENGTH DC 6 N GR1 GR2 GR3 GR4 A B C HANOISUB GR2 GR3 GR4 HANOISUB GR1 MOVE -> A -> C A -> B C -> B A -> C B -> A B -> C A -> C A 1 DC A DC #2345 B DC #ABCD A B A B DMEM * MESSAGE1 * Start:000D End:000E 0008: ABCD DC DS
95 95 A DC 7 B DS 2 DUMPE DC -1 A B A B A DUMPE DMEM * MESSAGE1 * Start:0011 End: : FFFF DC DS A DC 3 B DC 8 ADD DS 1 SUB DS 1 DUMPE DC -1 A B ADD A B SUB A DUMPE DMEM * MESSAGE1 * Start:0011 End: : B FFFB FFFF DC DS A DC #F0F0 B DC #FF00 AND DS 1 OR DS 1 XOR DS 1 DUMPE DC -1 A B AND A B OR A B XOR A DUMPE DMEM * MESSAGE1 * Start:0017 End:001C 0010: F0F : FF00 F000 FFF0 0FF0 FFFF DC DS A DC #67BC B DS 1 A 8 8 B A B DMEM * MESSAGE1 * Start:0010 End: : 67BC BC
96 96 A 6 DREG GR GR DC DS LENGTH DC 8 A DC 38,32,54,27,48,30,63,34 RESULT DS 1 DUMPE DC -1 A 8 RESULT A DUMPE DMEM * MESSAGE1 * Start:0020 End: : 003F FFFF ?. 8 DC DS LENGTH DC 14 A DC 43,27,88,65,31,46,72,83,36,53,24,37,64,22 DUMPE DC -1 A 14 A DUMPE DMEM * MESSAGE1 * Start:002D End:003B 0028: B : 001F B 002E $%+.5@A 0038: FFFF HSX. (ascending order) (descending order) (sort) (bubble sort) 1 1
97 DC DS N DC 8820 FACTORS DS 16 DUMPE DC -1 N FACTORS N DUMPE DMEM * MESSAGE1 * Start:002F End: : : : : FFFF n m n m 0 m n (divisor) (prime number) (composite number)
98 98 A n 2 n n (prime factor) (integer factorization) n 2 n (1) 2 m (2) n 1 (3) n m (4) 0 m n (2) (5) 0 m 1 m (3) DMEM * MESSAGE1 * Start:00B7 End:00EA 00B0: B8: B 000D C0: 001D 001F B 002F B..%)+/5 00C8: 003D F =CGIOSYa 00D0: *00E8: FFFF n 2 2 n (sieve of Eratosthenes) 2 n (1) 2 n (2) 2 i (3) (4) (5) i 2 n (4) i i (5) i 1 i 11 X x IN? Let s "Hello, World!" Xxx x "Xxxxx, Xxxxx!" 12
99 99 IN? dog cat mouse rabbit monkey dogcatmouserabbitmonkey 13 1 IN? dog cat mouse rabbit monkey dog cat mouse rabbit monkey (capitalize) IN? good code is its own best documentation Good Code Is Its Own Best Documentation IN? Hello, World! C 6C 6F 2C F 72 6C yes no 2 ( )) ()( )((( () () (()) ((())) (((()))) ((((())))) () ()() (()) () (())() ()() () ()()()
100 100 A ()() (()()) (())() ((())()) ()()() (()()()) IN? ((()())()) yes IN? ((())()))()) no IN? ((()())() no 0 n n * / % a (a+b) ((a+b)*c) ((a+b)/(c-d)) * / % a ab+ ab+c* ab+cd-/ IN? ((a+b)/(c-d))
101 101 ab+cd-/ (1) (2) (a+b)) #FFFF (a+b-) IN? 78 IN? IN? IN? IN
102 102 A (Roman numerals) I V X L C D M 7 i v x l c d m I = 1 V = 5 X = 10 L = 50 C = 100 D = 500 M = 1000 I X C M 4 3 II = 2 XX = 20 CC = 200 MM = 2000 III = 3 XXX = 30 CCC = 300 MMM = 3000 V L D 3 VI = 6 XI = 11 XXII = 22 XXXVIII = 38 LX = 60 CX = 110 CCXX = 220 CCCLXXX = 380 DC = 600 MC = 1100 MMCC = 2200 MMMDCCC = IV = 4 XL = 40 CD = 400 IX = 9 XC = 90 CM = XIV = 14 XLIX = 49 MCMLVIII = 1958 MMMCDXLIV = 3444 MMMCDXCVIII = 3498 MMMCMXCIX = 3999 IN? mmmcdxcviii DC DS A DC 3
103 103 B DC 5 P DS 1 DUMPE DC -1 A a B b a b (a b ) P A DUMPE DMEM * MESSAGE1 * Start:002C End:002F 0028: F3 FFFF... a b (power) a b b a a a a a }{{} b a { a 0 = 1 b 1 a b = a a b 1 B 1 SWAP START LD GR0,A LD GR1,B ST GR0,B ST GR1,A DMEM MSG,A,B A DC #2345 B DC #ABCD 2 INCDEC START LD GR1,A LAD GR2,1,GR1 ST GR2,B LAD GR2,-1,GR1 LAD GR3,1 ST GR2,B,GR3 DMEM MSG,A,DUMPE A DC 7 B DS 2 DUMPE DC -1 3 ADDSUB START LD GR1,A ADDA GR1,B
104 104 B ST GR1,ADD LD GR1,A SUBA GR1,B ST GR1,SUB DMEM MSG,A,DUMPE A DC 3 B DC 8 ADD DS 1 SUB DS 1 DUMPE DC -1 4 ANDOR START LD GR1,A AND GR1,B ST GR1,AND LD GR1,A OR GR1,B ST GR1,OR LD GR1,A XOR GR1,B ST GR1,XOR DMEM MSG,A,DUMPE A DC #F0F0 B DC #FF00 AND DS 1 OR DS 1 XOR DS 1 DUMPE DC -1 5 REPLACE START LD GR1,A LD GR2,A SLL GR1,8 SRL GR2,8 OR GR1,GR2 ST GR1,B DMEM MSG,A,B A DC #67BC B DS 1 6 SEVEN START LAD GR0,0 LOOP ADDL GR0,STEP CPL GR0,LIMIT JMI LOOP STEP DC 7 LIMIT DC MAX START LD GR1,A LAD GR2,1
main.dvi
20 II 7. 1 409, 3255 e-mail: namba@faculty.chiba-u.jp 2 1 1 1 4 2 203 2 1 1 1 5 503 1 3 1 2 2 Web http://www.icsd2.tj.chiba-u.jp/~namba/lecture/ 1 2 1 5 501 1,, \,", 2000 7. : 1 1 CPU CPU 1 Intel Pentium
アセンブラ入門（CASL II） 第３版
CASLDV i COMET II COMET II CASL II COMET II 1 1 44 (1969 ) COMETCASL 6 (1994 ) COMETCASL 13 (2001 ) COMETCASL COMET IICASL II COMET IICASL II CASL II 2001 1 3 3 L A TEX 2 CASL II COMET II 6 6 7 Windows(Windows
PowerPoint プレゼンテーション
コンピュータアーキテクチャ 第 7 週命令セットアーキテクチャ ( 命令の表現 命令の実行の仕組 ) 2013 年 11 月 6 日 金岡晃 授業計画 第 1 週 (9/25) 第 2 週 (10/2) 第 3 週 (10/9) 第 4 週 (10/16) 第 5 週 (10/23) 第 6 週 (10/30) 第 7 週 (11/6) 授業概要 2 進数表現 論理回路の復習 2 進演算 ( 数の表現
主記憶の使われ方 システム領域 SP スタックポインタ システム用 スタック用 プログラム起動時に OS によって確 保される (SP が決められる ) プログラム用 メインルーチン プログラム領域 命令コードの列定数 変数用領域サブルーチン命令コードの列 先頭番地は リンク時に OS によって決め
Copyright 守屋悦朗 2005 コンピュータの仕組み (2) ソフトウェア 3.3 アセンブラプログラミング (CASLⅡ) 情報処理技術者試験基本情報技術者試験 (http://www.jitec.jp/index.html) では 仮想コンピュータ (16ビットのワードマシン 主記憶容量 64KW)COMETⅡを定義し COMETⅡ のためのアセンブリ言語 CASLⅡを定めている COMETⅡとCASLⅡの仕様は情報処理技術者試験センターのウェブサイト
CASL入門
4 章 機械語の設計 ここでは 機械語の設計をしてみましょう 機械語の設計! そんなことができるのでしょうか 情報処理技術者試験の CASLⅡ 説明書の参考資料には 命令後の構成は定義しないが と記載されています アセンブラ言語を理解するためには機械語の理解が非常に大切になりますし 自分で設計してみれば格段に理解が容易になります そこで 定義されていないなら 定義してしまおう というわけです CASLⅡが動くコンピュータである
Microsoft PowerPoint - ProcML-12-3.ppt
プロセッサと 年次前次前期 ( 第 回 ) 進数の加減算 (overflow( overflow) 演習 次の ビット演算の結果は overflow か? () + + () + + 答 答 中島克人 情報メディア学科 nakajima@im.dendai.ac.jp () - = + + 答 進数の加減算 (overflow( overflow) 演習 次の ビット演算の結果は overflow
3 SIMPLE ver 3.2: SIMPLE (SIxteen-bit MicroProcessor for Laboratory Experiment) 1 16 SIMPLE SIMPLE 2 SIMPLE 2.1 SIMPLE (main memo
3 SIMPLE ver 3.2: 20190404 1 3 SIMPLE (SIxteen-bit MicroProcessor for Laboratory Experiment) 1 16 SIMPLE SIMPLE 2 SIMPLE 2.1 SIMPLE 1 16 16 (main memory) 16 64KW a (C )*(a) (register) 8 r[0], r[1],...,
compiler-text.dvi
2018.4 1 2 2.1 1 1 1 1: 1. (source program) 2. (object code) 3. 1 2.2 C if while return C input() output() fun var ( ) main() C (C-Prime) C A B C 2.3 Pascal P 1 C LDC load constant LOD load STR store AOP
コンピュータ工学Ⅰ
コンピュータ工学 Ⅰ 中央処理装置 Rev. 2019.01.16 コンピュータの基本構成と CPU 内容 ➊ CPUの構成要素 ➋ 命令サイクル ➌ アセンブリ言語 ➍ アドレッシング方式 ➎ CPUの高速化 ➏ CPUの性能評価 コンピュータの構成装置 中央処理装置 (CPU) 主記憶装置から命令を読み込み 実行を行う 主記憶装置 CPU で実行するプログラム ( 命令の集合 ) やデータを記憶する
.,. 0. (MSB). =2, =1/2.,. MSB LSB, LSB MSB. MSB 0 LSB 0 0 P
, 0 (MSB) =2, =1/2, MSB LSB, LSB MSB MSB 0 LSB 0 0 P61 231 1 (100, 100 3 ) 2 10 0 1 1 0 0 1 0 0 100 (64+32+4) 2 10 100 2 5, ( ), & 3 (hardware), (software) (firmware), hardware, software 4 wired logic
改訂履歴 Ver 年 ( 平成 30 年 )5 月 25 日ページ変更点 1 試験問題に出題する Java の変更 (Third Edition から Java SE 8 Edition に変更 ) Ver 年 ( 平成 28 年 )10 月 21 日ページ変更点
情報処理技術者試験情報処理安全確保支援士試験 試験で使用する情報技術に関する用語 プログラム言語など Ver.3.1 1. 情報技術に関する用語... 1 2. 記号 図など... 1 3. プログラム言語... 1 4. データベース言語... 1 5. マーク付け言語 ( マークアップ言語 )... 1 6. 表計算ソフトなどのソフトウェアパッケージ... 2 別紙 1 アセンブラ言語の仕様...
Microsoft PowerPoint - NxLecture ppt [互換モード]
![Microsoft PowerPoint - NxLecture ppt [互換モード]](/thumbs/84/89855106.jpg "Microsoft PowerPoint - NxLecture ppt [互換モード]")
011-05-19 011 年前学期 TOKYO TECH 命令処理のための基本的な 5 つのステップ 計算機アーキテクチャ第一 (E) 5. プロセッサの動作原理と議論 吉瀬謙二計算工学専攻 kise_at_cs.titech.ac.jp W61 講義室木曜日 13:0-1:50 IF(Instruction Fetch) メモリから命令をフェッチする. ID(Instruction Decode)
ohp1.dvi
2008 1 2008.10.10 1 ( 2 ) ( ) ( ) 1 2 1.5 3 2 ( ) 50:50 Ruby ( ) Ruby http://www.ruby-lang.org/ja/ Windows Windows 3 Web Web http://lecture.ecc.u-tokyo.ac.jp/~kuno/is08/ / ( / ) / @@@ ( 3 ) @@@ :!! ( )
コンピュータ工学Ⅰ
コンピュータ工学 Ⅰ Rev. 2018.01.20 コンピュータの基本構成と CPU 内容 ➊ CPUの構成要素 ➋ 命令サイクル ➌ アセンブリ言語 ➍ アドレッシング方式 ➎ CPUの高速化 ➏ CPUの性能評価 コンピュータの構成装置 中央処理装置 (CPU) 主記憶装置から命令を読み込み 実行を行う 主記憶装置 CPU で実行するプログラム ( 命令の集合 ) やデータを記憶する 補助記憶装置
CASL入門
3 章 アセンブラ言語 CASLⅡ の仕様 ここでは アセンブラ言語の説明をします ちょっと待て 第 2 章の話は アセンブラ言語の話ではなかったのか と思われた人はいませんでしょうか 一般に プログラム という場合 その構成要素は次の 3 つに分かれます 1 動作のための命令加算 減算 比較などの命令 2 領域確保や定数定義など 動作しない部分 3 プログラム名の定義などこのうち 1が第 3 章で説明した部分にあたります
( ) ( ) ( ) 2
(Basic Theory of Information Processing) 1 1 1.1 - - ( ) ( ) ( ) 2 Engineering Transformation or ( ) Military Transformation ( ) ( ) ( ) HDTV 3 ( ) or ( ) 4 5.609 (TSUBAME2.5, 11 (2014.6)) IP ( ) ( ) (
r1.dvi
2014 1 2014.4.10 0 / 1 / 2 / 3 Lisp 4 5 ( ) 1 (5 1 ) 5 1 1.1? 0 1 (bit sequence) 5 101 3 11 2 (binary system) 2 1000 8 1 ( ) ( )? ( 1) r1 1000 1001 r2 1002... r3 1: (memory) (address) CPU (instruction)
alpha alpha03 Copyright c Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution 2.1 Japan License.
alpha03 alpha03 2018 9 16 alpha03 Copyright c 2017 2018 Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution 2.1 Japan License. 3 1 4 1.1......................................
2005 1
25 SPARCstation 2 CPU central processor unit 25 2 25 3 25 4 DRAM 25 5 25 6 : DRAM 25 7 2 25 8 2 25 9 2 bit: binary digit V 2V 25 2 2 2 2 4 5 2 6 3 7 25 A B C A B C A B C A B C A C A B 3 25 2 25 3 Co Cin
untitled
13 Verilog HDL 16 CPU CPU IP 16 1023 2 reg[ msb: lsb] [ ]; reg [15:0] MEM [0:1023]; //16 1024 16 1 16 2 FF 1 address 8 64 `resetall `timescale 1ns/10ps module mem8(address, readdata,writedata, write, read);
Microsoft PowerPoint - NxLec ppt
MIPS R3000 Instruction Set Architecture (ISA) 計算機アーキテクチャ特論 (Advanced Computer Architectures) 2. スカラプロセッサ, スーパースカラプロセッサ Instruction Categories Computational Load/Store Jump and Branch Floating Point coprocessor
プログラマから見えるCPU 一番下のレベルでコンピュータ上のプログラムがど のように表現されているかを理解する プログラムがどう表現されているか プログラムはコンピュータのメモリ上に載っている コンピュータのメモリには数字しか格納できない したがってプログラムは数字である どう表現されているのか 数
計算機学 モデル計算機とソフトウェア プログラマから見えるCPU 一番下のレベルでコンピュータ上のプログラムがど のように表現されているかを理解する プログラムがどう表現されているか プログラムはコンピュータのメモリ上に載っている コンピュータのメモリには数字しか格納できない したがってプログラムは数字である どう表現されているのか 数字で表現された 命令 機械語 CPUごとに異なる コンピュータの構成
1 Code Generation Part I Chapter 8 (1 st ed. Ch.9) COP5621 Compiler Construction Copyright Robert van Engelen, Florida State University,
1 Code Generation Part I Chapter 8 (1 st ed. Ch.9) COP5621 Compiler Construction Copyright Robert van Engelen, Florida State University, 2007-2013 2 Position of a Code Generator in the Compiler Model Source
1 8 Z80 Z GBA ASIC 2 WINDOWS C 1
1 8 Z80 Z80 20 8080 GBA ASIC 2 WINDOWS C 1 2.1 Z-80 A 0 - A 15 CPU Z80 D 0- D 7 I/O Z80 1: 1 (1) CPU CPU Z80 CPU Z80 AND,OR,NOT, (2) CPU (3) I/O () Z80 (4) 2 Z80 I/O 16 16 A 0, A 1,, A 15 (5) Z80I/O 8
スパコンに通じる並列プログラミングの基礎
2018.09.10 furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 1 / 59 furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 2 / 59 Windows, Mac Unix 0444-J furihata@cmc.osaka-u.ac.jp ( ) 2018.09.10 3 / 59 Part I Unix GUI CUI:
(CC Attribution) Lisp 2.1 (Gauche )
http://www.flickr.com/photos/dust/3603580129/ (CC Attribution) Lisp 2.1 (Gauche ) 2 2000EY-Office 3 4 Lisp 5 New York The lisps Sammy Tunis flickr lisp http://www.flickr.com/photos/dust/3603580129/ (CC
I117 II I117 PROGRAMMING PRACTICE II DEBUG Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara
I117 II I117 PROGRAMMING PRACTICE II DEBUG Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara yasu@jaist.ac.jp / SCHEDULE 1. 2011/06/07(Tue) / Basic of Programming 2. 2011/06/09(Thu)
スパコンに通じる並列プログラミングの基礎
2016.06.06 2016.06.06 1 / 60 2016.06.06 2 / 60 Windows, Mac Unix 0444-J 2016.06.06 3 / 60 Part I Unix GUI CUI: Unix, Windows, Mac OS Part II 0444-J 2016.06.06 4 / 60 ( : ) 6 6 ( ) 6 10 6 16 SX-ACE 6 17
スパコンに通じる並列プログラミングの基礎
2018.06.04 2018.06.04 1 / 62 2018.06.04 2 / 62 Windows, Mac Unix 0444-J 2018.06.04 3 / 62 Part I Unix GUI CUI: Unix, Windows, Mac OS Part II 2018.06.04 4 / 62 0444-J ( : ) 6 4 ( ) 6 5 * 6 19 SX-ACE * 6
TEX American Mathematical Society PostScript Adobe Systems Incorporated
P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp) 1996 11 2 TEX American Mathematical Society PostScript Adobe Systems Incorporated pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD
1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf ("%s", str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i
![1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i](/thumbs/89/99201513.jpg "1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i")
ABC066 / ARC077 writer: nuip 2017 7 1 For International Readers: English editorial starts from page 8. A : ringring a + b b + c a + c a, b, c a + b + c 1 # include < stdio.h> 2 3 int main (){ 4 int a,
? FPGA FPGA FPGA : : : ? ( ) (FFT) ( ) (Localization) ? : 0. 1 2 3 0. 4 5 6 7 3 8 6 1 5 4 9 2 0. 0 5 6 0 8 8 ( ) ? : LU Ax = b LU : Ax = 211 410 221 x 1 x 2 x 3 = 1 0 0 21 1 2 1 0 0 1 2 x = LUx = b 1 31
「FPGAを用いたプロセッサ検証システムの製作」
FPGA 2210010149-5 2005 2 21 RISC Verilog-HDL FPGA (celoxica RC100 ) LSI LSI HDL CAD HDL 3 HDL FPGA MPU i 1. 1 2. 3 2.1 HDL FPGA 3 2.2 5 2.3 6 2.3.1 FPGA 6 2.3.2 Flash Memory 6 2.3.3 Flash Memory 7 2.3.4
i
i ii iii iv v vi vii viii ix x xi ( ) 854.3 700.9 10 200 3,126.9 162.3 100.6 18.3 26.5 5.6/s ( ) ( ) 1949 8 12 () () ア イ ウ ) ) () () () () BC () () (
CASL入門
2 章 システム COMETⅡ の仕様 ここでは 情報処理推進機構 (IPA) が発行している情報処理技術者試験のパンフレットにある アセンブラ言語の仕様 にそって説明していきます この資料では システム COMETⅡの仕様 の中に命令の説明が書かれており アセンブラ言語 CASLⅡの仕様 には命令の説明は記載されていません 何か奇異な感じがしますが アセンブラの命令はハードウェア命令そのものであるので
Copyright c 2008 Zhenjiang Hu, All Right Reserved.
2008 10 27 Copyright c 2008 Zhenjiang Hu, All Right Reserved. (Bool) True False data Bool = False True Remark: not :: Bool Bool not False = True not True = False (Pattern matching) (Rewriting rules) not
New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\
![New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\](/thumbs/92/109450602.jpg "New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\")
Specview VO 2012 2012/3/26 Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software hardware/specview http://specview.stsci.edu/javahelp/main.html
HITACHI 液晶プロジェクター CP-EX301NJ/CP-EW301NJ 取扱説明書 -詳細版- 【技術情報編】 日本語
A B C D E F G H I 1 3 5 7 9 11 13 15 17 19 2 4 6 8 10 12 14 16 18 K L J Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C RS-232C RS-232C Cable (cross) LAN cable (CAT-5 or greater) LAN LAN LAN LAN RS-232C BE
Ⅰ Report#1 Report#1 printf() /* Program : hello.c Student-ID : 095740C Author UpDate Comment */ #include int main(){ : Yuhi,TOMARI : 2009/04/28(Thu) : Used Easy Function printf() 10 printf("hello,
1... 1 2... 1 1... 1 2... 2 3... 2 4... 4 5... 4 6... 4 7... 22 8... 22 3... 22 1... 22 2... 23 3... 23 4... 24 5... 24 6... 25 7... 31 8... 32 9... 3
3 2620149 3 6 3 2 198812 21/ 198812 21 1 3 4 5 JISJIS X 0208 : 1997 JIS 4 JIS X 0213:2004 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1 2... 1 1... 1 2... 2 3... 2 4... 4 5... 4 6... 4 7... 22
HITACHI 液晶プロジェクター CP-AX3505J/CP-AW3005J 取扱説明書 -詳細版- 【技術情報編】
B A C E D 1 3 5 7 9 11 13 15 17 19 2 4 6 8 10 12 14 16 18 H G I F J M N L K Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C LAN RS-232C LAN LAN BE EF 03 06 00 2A D3 01 00 00 60 00 00 BE EF 03 06 00 BA D2 01
2008 IIA (program) pro(before)+gram(write) (artificial language) (programming languege) (programming) (machine language) (assembly language) ( )
2008 IIA 1 1.1 (program) pro(before)+gram(write) (artificial language) (programming languege) (programming) (machine language) (assembly language) () (high-level language) 3 (machine language) (CPU) 0
取扱説明書 -詳細版- 液晶プロジェクター CP-AW3019WNJ
B A C D E F K I M L J H G N O Q P Y CB/PB CR/PR COMPONENT VIDEO OUT RS-232C LAN RS-232C LAN LAN BE EF 03 06 00 2A D3 01 00 00 60 00 00 BE EF 03 06 00 BA D2 01 00 00 60 01 00 BE EF 03 06 00 19 D3 02 00
ディジタルシステム設計
Z80 Z80 Z80 Z80 ROM RAM I/O 8255 8251 Z80PIO Z80CTC Z80SIO R C L Tr OP TTL MCB Z MC Z Z80 Z80 TMPZ84015BF KL5C8012 64180 H8 H8 PIC Microchip Technology PIC Z80 F A A' ALU B D H C E L IX IY SP PC C E L
HDZ-2500iS_2570iTS
HDZ-2500iS HDZ-2570iTS c PRINTED IN JAPAN B64-2337-10/04 001 002 003 901 START NO 381 387 YES NO YES YES NO 002 111 NO YES 116 NO YES 114 YES NO YES NO 106 Next Page 002 YES NO YES NO NO YES NO YES 106
PRIMERGY 6560/6760 取扱説明書
PRIMERGY 6000 PRIMERGY 6560/6760 i ii 2008 12 2008 12 (VCCI) JIS C 61000-3-2 Copyright FUJITSU LIMITED 2008 iii iv AC100V UPS UPS v 20kg 15 15 vi vii MODEL : PG6xxxxxx SER. NO : XXXXXX CHECK CODE : XX
( ) Shift JIS ( ) ASCII ASCII ( ) 8bit = 1 Byte JIS(Japan Industrial Standard) X 0201 (X ) 2 Byte JIS ISO-2022-JP, Shift JIS, EUC 1 Byte 2 By
23 3 ( ( (binary file) UNIX CUI 3.1 = + 2 bit ) ( 3.1) bit bit 1 Byte=8 bit 1 Byte ASCII, JIS X 0201 ASCII(American Standard Code for Information Interchange) 7bit (;) (:) ( ) (") ) 7bit ( ) 24 3 3.1 (
Specview Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page htt
Specview Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software_hardware/specview http://specview.stsci.edu/javahelp/main.html Specview
26102 (1/2) LSISoC: (1) (*) (*) GPU SIMD MIMD FPGA DES, AES (2/2) (2) FPGA(8bit) (ISS: Instruction Set Simulator) (3) (4) LSI ECU110100ECU1 ECU ECU ECU ECU FPGA ECU main() { int i, j, k for { } 1 GP-GPU
™…
i 1 1 1 2 3 5 5 6 7 9 10 11 13 13 14 15 15 16 17 18 20 20 20 21 22 ii CONTENTS 23 24 26 27 2 31 31 32 32 33 34 37 37 38 39 39 40 42 42 43 44 45 48 50 51 51 iii 54 57 58 60 60 62 64 64 67 69 70 iv 70 71
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(
![AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(](/thumbs/104/161880166.jpg "AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(")
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) 29 4 29 A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]: print( YES ) else: print( NO ) 1 B:
i
14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7
...J......1803.QX
5 7 9 11 13 15 17 19 21 23 45-1111 48-2314 1 I II 100,000 80,000 60,000 40,000 20,000 0 272,437 80,348 82,207 81,393 82,293 83,696 84,028 82,232 248,983 80,411 4,615 4,757 248,434 248,688 76,708 6,299
all.dvi
fortran 1996 4 18 2007 6 11 2012 11 12 1 3 1.1..................................... 3 1.2.............................. 3 2 fortran I 5 2.1 write................................ 5 2.2.................................
if clear = 1 then Q <= " "; elsif we = 1 then Q <= D; end rtl; regs.vhdl clk 0 1 rst clear we Write Enable we 1 we 0 if clk 1 Q if rst =
VHDL 2 1 VHDL 1 VHDL FPGA VHDL 2 HDL VHDL 2.1 D 1 library ieee; use ieee.std_logic_1164.all; use ieee.std_logic_unsigned.all; regs.vhdl entity regs is clk, rst : in std_logic; clear : in std_logic; we
スライド 1
東北大学工学部機械知能 航空工学科 2015 年度 5 セメスター クラス D 計算機工学 6. MIPS の命令と動作 演算 ロード ストア ( 教科書 6.3 節,6.4 節 ) 大学院情報科学研究科鏡慎吾 http://www.ic.is.tohoku.ac.jp/~swk/lecture/ レジスタ間の演算命令 (C 言語 ) c = a + b; ( 疑似的な MIPS アセンブリ言語 )
VLD Kazutoshi Kobayashi
VLD Kazutoshi Kobayashi (kobayasi@kuee.kyoto-u.ac.jp) 2005 8 26-29 1, Verilog-HDL, Verilog-HDL. Verilog-HDL,, FPGA,, HDL,. 1.1, 1. (a) (b) (c) FPGA (d). 2. 10,, Verilog-HDL, FPGA,. 1.2,,,, html. % netscape
LAN Copyright c Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution 2.1 Japan License
LAN 2014 3 19 Copyright c 1993 2014 Daikoku Manabu This tutorial is licensed under a Creative Commons Attribution 2.1 Japan License. 1 2 1.1................................... 2 1.2.........................
エクセルカバー入稿用.indd
i 1 1 2 3 5 5 6 7 7 8 9 9 10 11 11 11 12 2 13 13 14 15 15 16 17 17 ii CONTENTS 18 18 21 22 22 24 25 26 27 27 28 29 30 31 32 36 37 40 40 42 43 44 44 46 47 48 iii 48 50 51 52 54 55 59 61 62 64 65 66 67 68
コンピュータ概論
4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
レーザビームプリンタ Satera ユーザーズガイド
JPN CD-ROM CD-ROM CD-ROM CD-ROM CD-ROM CD-ROM CD-ROM ii iii iv v vi vii viii ix x xi xii a b c d b c d a xiii xiv xv xvi xvii xviii xix xx 1 CHAPTER 1-1 1-2 1-3 1-4 b a n m l k j c d f g e i h a b c d
0.2 Button TextBox: menu tab 2
Specview VO 2012 2012/9/27 Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software hardware/specview http://specview.stsci.edu/javahelp/main.html
1... 1 1... 1 2... 1 3... 1 4... 4 5... 7 6... 7 7... 12 8... 12 9... 13 10... 13 11... 13 12... 14 2... 14 1... 14 2... 16 3... 18 4... 19 5... 19 6.
3 2620149 1 3 8 3 2 198809 1/1 198809 1 1 3 4 5 JISJIS X 0208 : 1997 JIS 4 JIS X 0213:2004 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1 1... 1 2... 1 3... 1 4... 4 5... 7 6... 7 7... 12 8... 12
main.dvi
1 F77 5 hmogi-2008f@kiban.civil.saitama-u.ac.jp 2013/5/13 1 2 f77... f77.exe f77.exe CDROM (CDROM D D: setupond E E: setupone 5 C:work\T66160\20130422>f77 menseki.f -o menseki f77(.exe) f77 f77(.exe) C:work\T66160\20130422>set
TK-S686_S686WP
TK-S686 TK-S686WP TK-S686 TK-S686WP LST0659-00B 2 ( ) T A 3 4 g g I _I I _I _ I_ I 5 A A B A B 6 7 A B C D E I H G F J K L N M A _ _ A B C J A K 8 D A B C D E A F O G A H S O R R P Q T I J A T A K A L
Microsoft PowerPoint - Lecture ppt [互換モード]
![Microsoft PowerPoint - Lecture ppt [互換モード]](/thumbs/84/89855110.jpg "Microsoft PowerPoint - Lecture ppt [互換モード]")
2012-05-31 2011 年前学期 TOKYO TECH 固定小数点表現 計算機アーキテクチャ第一 (E) あまり利用されない 小数点の位置を固定する データ形式 (2) 吉瀬謙二計算工学専攻 kise_at_cs.titech.ac.jp W641 講義室木曜日 13:20-14:50-2.625 符号ビット 小数点 1 0 1 0 1 0 1 0 4 2 1 0.5 0.25 0.125
01_.g.r..
I II III IV V VI VII VIII IX X XI I II III IV V I I I II II II I I YS-1 I YS-2 I YS-3 I YS-4 I YS-5 I YS-6 I YS-7 II II YS-1 II YS-2 II YS-3 II YS-4 II YS-5 II YS-6 II YS-7 III III YS-1 III YS-2
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009631 このサンプルページの内容は, 初版 1 刷発行時のものです. Excel URL http://www.morikita.co.jp/books/mid/009631 i Microsoft Windows
/ SCHEDULE /06/07(Tue) / Basic of Programming /06/09(Thu) / Fundamental structures /06/14(Tue) / Memory Management /06/1
I117 II I117 PROGRAMMING PRACTICE II 2 MEMORY MANAGEMENT 2 Research Center for Advanced Computing Infrastructure (RCACI) / Yasuhiro Ohara yasu@jaist.ac.jp / SCHEDULE 1. 2011/06/07(Tue) / Basic of Programming
プロセッサ・アーキテクチャ
2. NII51002-8.0.0 Nios II Nios II Nios II 2-3 2-4 2-4 2-6 2-7 2-9 I/O 2-18 JTAG Nios II ISA ISA Nios II Nios II Nios II 2 1 Nios II Altera Corporation 2 1 2 1. Nios II Nios II Processor Core JTAG interface
Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal
Pascal Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS 2010 10 1 Pascal 2 1.1.......................... 2 1.2.................. 2 1.3........................ 3 2 4 2.1................................
OFISTAR H7000ファクス編（2版 ）
i ii A iii A A A A A A A A A B C D A A B C D iv B A AB A A B A B A v A C B A ABC A B C A A vi A B B A A A A A A vii A A viii ix 4 5 6 8 9 0 x xi 5 6 9 6 06 C 4 5 8 6 9 0 C 06 06 06 064 065 066 06 068 069
Canon Industrial Imaging Platform Vision Edition 使用説明書
Ver. 1.1 Canon Industrial Imaging Platform Vision Edition 2 Canon Industrial Imaging Platform Vision Edition * PC PC Power over Ethernet * A 180 ( ) - - - - - - - ( ) - - - - - AF AF 3 ( ) A PC PoE PLC
Fortran90/95 [9]! (1 ) " " 5 "Hello!"! 3. (line) Fortran Fortran 1 2 * (1 ) 132 ( ) * 2 ( Fortran ) Fortran ,6 (continuation line) 1
![Fortran90/95 [9]! (1 ) 5 Hello!! 3. (line) Fortran Fortran 1 2 * (1 ) 132 ( ) * 2 ( Fortran ) Fortran ,6 (continuation line) 1](/thumbs/48/24845697.jpg "Fortran90/95 [9]! (1 ) 5 Hello!! 3. (line) Fortran Fortran 1 2 * (1 ) 132 ( ) * 2 ( Fortran ) Fortran ,6 (continuation line) 1")
Fortran90/95 2.1 Fortran 2-1 Hello! 1 program example2_01! end program 2! first test program ( ) 3 implicit none! 4 5 write(*,*) "Hello!"! write Hello! 6 7 stop! 8 end program example2_01 1 program 1!
B. 41 II: 2 ;; 4 B [ ] S 1 S 2 S 1 S O S 1 S P 2 3 P P : 2.13:
![B. 41 II: 2 ;; 4 B [ ] S 1 S 2 S 1 S O S 1 S P 2 3 P P : 2.13:](/thumbs/94/118646867.jpg "B. 41 II: 2 ;; 4 B [ ] S 1 S 2 S 1 S O S 1 S P 2 3 P P : 2.13:")
B. 41 II: ;; 4 B [] S 1 S S 1 S.1 O S 1 S 1.13 P 3 P 5 7 P.1:.13: 4 4.14 C d A B x l l d C B 1 l.14: AB A 1 B 0 AB 0 O OP = x P l AP BP AB AP BP 1 (.4)(.5) x l x sin = p l + x x l (.4)(.5) m d A x P O
7 i 7 1 2 3 4 5 6 ii 7 8 9 10 11 1 12 13 14 iii.......................................... iv................................................ 21... 1 v 3 6 7 3 vi vii viii ix x xi xii xiii xiv xv 26 27
LM837 Low Noise Quad Operational Amplifier (jp)
Low Noise Quad Operational Amplifier Literature Number: JAJSBB7 600 Low Noise Quad Operational Amplifier 2000 8 Converted to nat2000 DTD ds009047tl/h/9047 33020 19860602 10 V/ s ( ); 8 V/ s ( ) 25 MHz
9 i 9 1 2 3 4 5 6 ii 7 8 9 10 11 12 .......................................... iii ... 1... 1........................................ 9 iv... v 3 8 9 3 vi vii viii ix x xi xii xiii xiv 34 35 22 1 2 1
i ii iii iv v vi vii viii ix x xi xii xiii xiv xv xvi 2 3 4 5 6 7 $ 8 9 10 11 12 13 14 15 16 17 $ $ $ 18 19 $ 20 21 22 23 24 25 26 27 $$ 28 29 30 31 $ $ $ 32 33 34 $ 35 $ 36 $ 37 38 39 40 $ 41 42 43 44
64bit SSE2 SSE2 FPU Visual C++ 64bit Inline Assembler 4 FPU SSE2 4.1 FPU Control Word FPU 16bit R R R IC RC(2) PC(2) R R PM UM OM ZM DM IM R: reserved
(Version: 2013/5/16) Intel CPU (kashi@waseda.jp) 1 Intel CPU( AMD CPU) 64bit SIMD Inline Assemler Windows Visual C++ Linux gcc 2 FPU SSE2 Intel CPU double 8087 FPU (floating point number processing unit)
2014.3.10 @stu.hirosaki-u.ac.jp 1 1 1.1 2 3 ( 1) x ( ) 0 1 ( 2)NOT 0 NOT 1 1 NOT 0 ( 3)AND 1 AND 1 3 AND 0 ( 4)OR 0 OR 0 3 OR 1 0 1 x NOT x x AND x x OR x + 1 1 0 x x 1 x 0 x 0 x 1 1.2 n ( ) 1 ( ) n x
BRADY Worldwide, Inc. BRADY BRADY BRADY BMP 51 BRADY Worldwide, Inc. Microsoft Windows Microsoft BRADY 2011 BRADY Worldwide, Inc. All Rights Reserved
BRADY Worldwide, Inc. BRADY BRADY BRADY BMP 51 BRADY Worldwide, Inc. Microsoft Windows Microsoft BRADY 2011 BRADY Worldwide, Inc. All Rights Reserved 2011 2 2 Brady Worldwide Inc. 6555 West Good Hope Road
6 4 45 7ZS 5 59 7 8 94 05 4 5 6 4 5 5 6 8 8 40 45 48 56 60 64 66 66 68 7 78 80 8 7 8 0 0 0 90 0 57 64 69 66 66 69 0 4 4 4 4 4 0 7 48 5 4 4 5 4 4 4 7 46 46 6 46 8 46 48 46 46 4 46 46 4 4 5 4 6 4 9 9 0
ProVisionaire Control V3.0セットアップガイド
ProVisionaire Control V3 1 Manual Development Group 2018 Yamaha Corporation JA 2 3 4 5 NOTE 6 7 8 9 q w e r t r t y u y q w u e 10 3. NOTE 1. 2. 11 4. NOTE 5. Tips 12 2. 1. 13 3. 4. Tips 14 5. 1. 2. 3.
1,.,,,., RDBM, SQL. OSS,, SQL,,.
1,.,,,., RDBM, SQL. OSS,, SQL,,. 3 10 10 OSS RDBMS SQL 11 10.1 OSS RDBMS............................ 11 10.1.1 PostgreSQL................................. 11 10.1.2 MySQL...................................
困ったときのQ&A
ii iii iv NEC Corporation 1997 v P A R T 1 vi vii P A R T 2 viii P A R T 3 ix x xi 1P A R T 2 1 3 4 1 5 6 1 7 8 1 9 1 2 3 4 10 1 11 12 1 13 14 1 1 2 15 16 1 2 1 1 2 3 4 5 17 18 1 2 3 1 19 20 1 21 22 1
素数ものさしの考察
( ) 2015 7 12 (2016.3.22 ) 1 / 18 18cm 2 3 5 7 11 13 17 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 18cm 18 cm 1cm 18cm 1cm 2 / 18 1? 3 / 18 1? Yes 20 : (0),2,3,5,7,11,13,17,19,(20) (5 13 ) 42 : (0),2,3,5,7,11,13,17,19,23,29,31,37,41,(42)
2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
01_OpenMP_osx.indd
OpenMP* / 1 1... 2 2... 3 3... 5 4... 7 5... 9 5.1... 9 5.2 OpenMP* API... 13 6... 17 7... 19 / 4 1 2 C/C++ OpenMP* 3 Fortran OpenMP* 4 PC 1 1 9.0 Linux* Windows* Xeon Itanium OS 1 2 2 WEB OS OS OS 1 OS
joho09.ppt
s M B e E s: (+ or -) M: B: (=2) e: E: ax 2 + bx + c = 0 y = ax 2 + bx + c x a, b y +/- [a, b] a, b y (a+b) / 2 1-2 1-3 x 1 A a, b y 1. 2. a, b 3. for Loop (b-a)/ 4. y=a*x*x + b*x + c 5. y==0.0 y (y2)
3 5 18 3 5000 1 2 7 8 120 1 9 1954 29 18 12 30 700 4km 1.5 100 50 6 13 5 99 93 34 17 2 2002 04 14 16 6000 12 57 60 1986 55 3 3 3 500 350 4 5 250 18 19 1590 1591 250 100 500 20 800 20 55 3 3 3 18 19 1590
Agenda GRAPE-MPの紹介と性能評価 GRAPE-MPの概要 OpenCLによる四倍精度演算 (preliminary) 4倍精度演算用SIM 加速ボード 6 processor elem with 128 bit logic Peak: 1.2Gflops
Agenda GRAPE-MPの紹介と性能評価 GRAPE-MPの概要 OpenCLによる四倍精度演算 (preliminary) 4倍精度演算用SIM 加速ボード 6 processor elem with 128 bit logic Peak: 1.2Gflops ボードの概要 Control processor (FPGA by Altera) GRAPE-MP chip[nextreme
10/ / /30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20 6. http, CGI Perl 11/27 7. ( ) Perl 12/ 4 8. Windows Winsock 12/11 9. JAV
tutimura@mist.i.u-tokyo.ac.jp kaneko@ipl.t.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/sem3/ 2002 12 11 p.1/33 10/16 1. 10/23 2. 10/30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20
Microsoft PowerPoint - 05Cobol.ppt
73 80 (Page) (Serial) 1 3 4 6 7 8 11 12 16 20 24 32 36 40 44 48 52 56 60 64 68 72 まずは COBOL 入門 プログラム言語論第五回 COBOL COmmon Business Oriented Language バッチ処理 ( それしかなかった ) 用に設計 データ書式 ( ファイル書式と処理途中のデータの書式 ) がまず念頭にある
6 4 4 9RERE6RE 5 5 6 7 8 9 4 5 6 4 4 5 6 8 4 46 5 7 54 58 60 6 69 7 8 0 9 9 79 0 4 0 0 4 4 60 6 9 4 6 46 5 4 4 5 4 4 7 44 44 6 44 8 44 46 44 44 4 44 0 4 4 5 4 8 6 0 4 0 4 4 5 45 4 5 50 4 58 60 57 54