Final

Question 1

Where is the first parameter on the stack held?

Answer 1

[EBP+8]

Question 2

Where is the return @ held on the stack

Answer 2

[Ebp+4]

Question 3

Where is saved ebp on the stack?

Answer 3

[ebp]

Question 4

Where is the 1st local variable on the stack?

Answer 4

[ebp-4]

Question 5

What needs to surround each sub program in a function?

Answer 5

Push ebp
Mov ebp,esp

…..

Pop ebp
Rey

Question 6

Local variables on the stack are stored…

Answer 6

In order

Question 7

Parameters in stack are stored in…

Answer 7

Reverse order

Question 8

Pushing an element is…

Answer 8

Decrease ESP by 4

Question 9

Popping an element is…

Answer 9

Increase by 4

Question 10

When translating from C to Nasm, if there is a local variable, in addition to the code surrounding the sub program you must…

Answer 10

Sub esp (the amount of local variables)

….

Add ESP, (the amount of local variables)

Question 11

Return @ main, saved ebp appears only after….

Answer 11

The parameters on the stack

Question 12

After each function on the stack, the stack pushes…

Answer 12

Return @ main,

Saved ebp

Question 13

The big picture of running code

Answer 13

(High level code) Compiler > (assembly code) assembler > (machine code) linker > machine code exec) loader > the program runs!

Question 14

What does the compiler do?

Answer 14

Takes in source code and scans and parses the code to them generate machine code

Question 15

The scanner identifies correct words using:

Answer 15

Regular expressions

Question 16

The parser identifies correct sentences by using

Answer 16

Context-free grammar

Question 17

Elipson?

Answer 17

Empty pattern

Question 18

a?

Answer 18

One occurrence of a

Question 19

Ab?

Answer 19

Strings with pattern a followed.by pattern b

Question 20

A|b

Answer 20

Strings with pattern a or pattern b

Question 21

A*?

Answer 21

Zero or more occurrences of a

Question 22

A+?

Answer 22

One or more occurrences of pattern a

Question 23

A? ?

Answer 23

(A| elipson)

Question 24

What does NFA stand for?

Answer 24

Non deterministic finite automata

This is different than a deterministic finite automata because you can use elipson to better organize the flow graph so that less edges are needed

Question 25

Acceptance state

Answer 25

An acceptance state in an NFA is a state that can be reached where the lexer can determine it's the end of a sentence

Question 26

How do you simplify a regular expression

Answer 26

First you write out all possibilities depending on the NFA. Then you look for matching terms in the beginning, and put the rest in parenthesis . If there is another end condition you can put an elipson in it

Question 27

What does CFA stand for?

Answer 27

Context free grammar

Question 28

What is a CFG?

Answer 28

The process of writing out expanding on terminal rules so that they can be expanded into terminal ones through a set of production rules

Question 29

When is a grammar ambiguous

Answer 29

If a string of terminal symbols can be reached by two different derivation sequences

Question 30

An object file contains what things?

Answer 30

A header, text segment, data segment, relocation table, symbol table, and possibly debugging info

Question 31

What does a header contain

Answer 31

Says where the files in the section below are located

Question 32

Text segment contains...

Answer 32

All source code

Question 33

Data segment contains....

Answer 33

All variables and global variables

Question 34

The relocation table defines

Answer 34

Lines of code that need to be fixed

Question 35

Symbol table contains

Answer 35

List of referenceble tables

Question 36

What does the linker do?

Answer 36

Combine several object files into an executable> concatenation text segment than has segments then resolves references using the relocation and symbol tables

Question 37

What does the loader do?

Answer 37

A loader is part of a OS and it creates new address space for the program that can hold the text and data segments along with stack, initializes the registers, starts the program

Question 38

What is static debugging?

Answer 38

Visual inspection of using print statements

Question 39

What is dynamic debugging?

Answer 39

Using an actual debugger to observe a program as it runs and to control its execution (adding breakpoints, etc.)