Simpletron Flashcards

(77 cards)

1
Q

fetches instructions,
decodes instructions, causes
instructions to be carried out

A

Control Unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

a special register with
individual bit positions that give
the status of the CPU (control
flags) or results of arithmetic
operations (status flags)

A

Flags

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

always
contains the offset of the next
instruction. The IP and CS
registers combine to form the
complete address. IP is also
known as PC – the program
counter.

A

IP(Instruction Pointer)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Branches to a specific location in
memory

A

BRANCH 40

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Branches to a specific location in
memory if the accumulator is
negative

A

BRANCHNEG 41

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Branches to a specific location in
memory if the accumulator is zero

A

BRANCHZERO 42

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

HALT

A

43

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Reads a word from the terminal into
a specific location in memory

A

READ 10

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Writes a word from a specific
location in memory to the terminal

A

WRITE 11

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Loads a word from a specific
location in memory into the
accumulator

A

LOAD 20

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Stores a word from the accumulator
into a specific location in memory

A

STORE 21

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Adds a word from a specific location
in memory to the word in the
accumulator(Leaves the result in the accumulator)

A

ADD 30

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Subtracts a word from a specific
location in memory from the word in
the accumulator
(leaves result in the accumulator

A

SUBTRACT 31

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

fetches instructions,
decodes instructions, causes
instructions to be carried out

A

Control Unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

performs arithmetic operations
(addition, etc.) on data.

A

Arithmetic logical unit (ALU)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

high speed memory cells
(don’t need to go through the bus to
access). They vary in number and
purpose on different machines.

A

Registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

communication pathways
connecting different
devices/components

A

Buses

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

also known as
general purpose registers: AX,
BX, CX, DX

A

Data registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Used for arithmetic operations
and data movement

A

Data registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

fastest for
arithmetic operations. Some math
instructions only use AX.

A

AX – accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

This register can hold an
address of a procedure or variable.
BX can also perform arithmetic and
data movement.

A

BX – base

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

this register acts as a
counter for repeating or looping
instructions

A

CX – counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

this register has a
special role in multiply and divide
operations. In multiplication it holds
the high 16 bits of the product. In
division it holds the remainder.

A

DX – data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

are used as
base locations for program
instructions, data, and the stack.

A

Segment registers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
All references to memory involve a segment register as the base location
Segment registers
26
this register holds the base location of all instructions in a program
CS – code segment
27
this is the default base location for variables. It is used by the CPU to calculate the variable location.
DS – data segment
28
this register contains the base location of the stack.
SS – stack segment
29
this is an additional base location for memory variables
ES – extra segment
30
contain the offsets of data and instructions.
Index registers
31
Offset refers to the distance of a variable, label, or instruction from its base segment.
Index registers
32
are used when processing strings, arrays, and other data structures.
Index registers
33
this register contains an offset from the SS register and is often used by subroutines to find the variables passed to it on the stack.
BP – base pointer
34
this register contains the offset from the top of the stack. The complete top of stack address is calculated using the SP and SS registers.
SP – stack pointer
35
used to point to data in memory. Named because this is the index register commonly used as the source in string operations (for example)
SI – source index
36
index register commonly used as the destination in string operations
DI - destination index
37
set if the result of an unsigned operation is too big to fit into the destination. 1 = carry, 0 = no carry
Carry flag (CF)
38
set if the result of a signed operation is too wide to fit into the destination. 1 = overflow, 0 = no overflow.
Overflow flag (OF)
39
set when the result of an operation is negative. 1 = negative, 0 = positive
Sign flag (SF)
40
set when the result of an arithmetic operation is zero. Used by branch and loop instructions when comparing values. 1 = zero, 0 = not zero.
Zero flag (ZF)
41
set when an operation causes a carry from bit 3 to bit 4 or a borrow from bit 4 to bit 3. 1= carry, 0 = no carry
Auxiliary Carry
42
indicates if the result of an operation has an even or odd number of bits. Used to verify memory integrity or correct transmission of data.
Parity
43
a number referring to an 8- bit memory location
Address
44
the Simpletron uses a keyboard for input and a terminal screen for output
I/O
45
the form or structure of the expressions, statements, and program units
Syntax
46
the meaning of the expressions, statements, and program units
Semantics
47
is a string of characters over some alphabet
sentence
48
is a set of sentences
language
49
is the lowest level syntactic unit of a language
lexeme
50
is a category of lexemes (e.g., identifier)
token
51
A recognition device reads input strings over the alphabet of the language and decides whether the input strings belong to the language
Recognizers
52
A device that generates sentences of a language
Generators
53
One can determine if the syntax of a particular sentence is syntactically correct by comparing it to the structure of the generator 4
Generators
54
Developed by Noam Chomsky in the mid‐1950s
Context‐Free Grammars
55
Invented by John Backus to describe Algol 58
Backus‐Naur Form (1959)
56
is one in which the leftmost nonterminal in each sentential form is the one that is expanded
leftmost derivation
57
may be neither leftmost nor rightmost
derivation
58
is ambiguous if and only if it generates a sentential form that has two or more distinct parse trees
grammar
59
Designed in 1945, but not published until 1972 * Never implemented * Advanced data structures * floating point, arrays, records * Invariants
Zuse’s Plankalkül
60
Distributed in 1958 * Independent compilation * Fixed the bugs
Fortran II
61
The ease with which programs can be moved from one implementation to another
Portability
62
The applicability to a wide range of applications
Generality
63
The completeness and precision of the language's official definition
Well-definedness
64
Programs are translated into machine language
Compilation
65
Programs are interpreted by another program known as an interpreter
Pure interpretation
66
A compromise between compilers and pure interpreters
Hybrid implementation systems
67
Languages are developed around prevalent computer architecture known as the von Neumann architecture
Computer architecture
68
The user and system code together
Load module
69
The process of collecting program units and linking them to a user programs
Linking and loading
70
Are commonly used to specify that code from another file is to be included
Preprocessor macros
71
Developed at MIT in mid 1970s * Small * Extensive use of static scoping * Functions as first‐class entities * Simple syntax (and small size) make it ideal for educational applications
Scheme
72
Evolved during 1960‐62 * Explicit type declarations * Logical selection statement * Subprogram names could be parameters * ANSI standard in 1966
Fortran IV
73
Became the new standard in 1978 * Character string handling * Logical loop control statement IF-THEN-ELSE statemen
Fortran 77
74
most significant changes from Fortran 77 * Modules * Dynamic arrays * Pointers * Recursion * CASE statement * Parameter type checking
Fortran 90
75
latest versions of Fortran
Fortran 95, fortran 2003
76
An effort to combine features of several dialects of LISP into a single language * Large, complex
COMMON LISP
77