Pl For Steevie

Front 1

first languages:

Back 1

assembly, fortran, cobol, lisp

Front 2

moving wires

Back 2

assembly

Front 3

scientific computation

Back 3

fortran

Front 4

business computation

Back 4

cobol

Front 5

AI programming

Back 5

lisp

Front 6

C came from _____ and ______, and implements UNIX

Back 6

assembly / fortran

Front 7

(60's) Stimula ----->

Back 7

Smalltalk

Front 8

Java came from both ____ and _____

Back 8

smalltalk and C++

Front 9

(80's) Perl -----> _____ ------> Ruby

Back 9

python

Front 10

if a TM can do it then so can the language =

Back 10

universal

Front 11

easy to express ideas and algorithms =

Back 11

natural

Front 12

can write a complier for =

Back 12

implementable

Front 13

writable, readable, orthogonal, regular, uniform =

Back 13

reliable

Front 14

writing, compiling, and execution=

Back 14

efficient

Front 15

easy to adapt to new hardware, etc. also can expand the language =

Back 15

maintainable/ extendable

Front 16

what is involved in an imperative/ procedural paradigm?

Back 16

variables, sequential augmentation, assignment

Front 17

what is involved in an applicative/ functional paradigm?

Back 17

no notion of store/ variables, no statements/ loops, no sequential execution

Front 18

example of an imperative/ procedural paradigm

Back 18

Scheme:

(define (gdc n v)

(if (= v o) u

(gcd v (module n v))

Front 19

example of an applicative/ functional paradigm:

Back 19

ML:

fun gcd (u,o) = u

1 gcd (u,v) = gcd (v, (umodv));

Front 20

What is involved in a logic paradigm?

Back 20

no control abstraction, no statements, no memory/ variables, properties of computation

Front 21

Example of logic paradigm

Back 21

prolog: when

gcd(u,v,u):-v=o

gcd (u,v,w) : -v>o,w is umodv,

gcd(v,w,x)

gcd(15,10,y)

Front 22

What is involved in an object oriented paradigm?

Back 22

objects and messages (really objects)

no statements

no expressions

no variables

Front 23

In an object oriented paradigm, how do you send a message to object?

Back 23

create boolean object

Front 24

In an object oriented paradigm, what do you do if there is a negative?

Back 24

start again

Front 25

there is also a parallel/ concurrent programming paradigm

Back 25

but he didn't put any notes for it...so.....

Front 26

a set of strings

Back 26

language

Front 27

a sequence of symbols

Back 27

strings

Front 28

generated with regular expressions. recognizable with finite atomaton. use with lexeme. the smallest unit in a language

Back 28

regular languages

Front 29

generated with phase structured grammars. recognizable with turing machines

Back 29

recursively enumerable languages

Front 30

generated with grammar. recognizable with push down automaton. used with syntax (only verifies the syntax)

Back 30

context free languages

Front 31

generated with attribute grammars. recognized by linearly bounded NTMA. use semantics

Back 31

context sensitive languages

Front 32

G= (V, T, P, S)

V a set of variables

T a set of terminal symbols

S & V denotes the start variable

P a set of replacement productions

Back 32

context free grammars

Front 33

in a conditional value assignment, you should use ____ instead of '.' for immediate assignment. '.' will only assign after the whole statement passes.

Back 33

$

Front 34

in a conditional value assignment, every statement can begin with a ____

Back 34

label

Front 35

denotes entity or construct

Back 35

name

Front 36

predefined and may not be redefined

Back 36

reserved words

Front 37

predefined and may be redefined

Back 37

key words

Front 38

What is the meaning of a name determined by?

Back 38

A set of attributes associated with the name (value, location, address, value, lifetime, scope, aliases)

Front 39

all data is linked together into an exe. separate compilation units. libraries

Back 39

link time

Front 40

loads the program into memory. addresses get set. locations get set

Back 40

load time

Front 41

dynamic locations and addresses (IE pointers). values also get set. aliases get set.

Back 41

execution time

Front 42

the range of the program during which the binding(s) exist(s)

Back 42

scope

Front 43

scope of the attribute is determined by examining the text program

Back 43

static or lexical scope

Front 44

scope is determined by flaw of execution

Back 44

dynamic scope

Front 45

process of verifying type infer in a program

Back 45

type checking

Front 46

provides type rules

Back 46

languages

Front 47

these are strongly typed

Back 47

ada, pascal, ML, haskell, scheme

Front 48

weakly typed

Back 48

C, C++, python

Front 49

untyped / dynamic

Back 49

perl, smalltalk, snobol 4, prolog

Front 50

what is type declaration used in?

Back 50

semantic checking

Front 51

integer, real, character, string, pattern, set, lists

Back 51

predefined types (simple)

Front 52

enum color (red green blue), type color is red green blue, data color is red green blue

Back 52

enumerated types

Front 53

type digit is 0..9

Back 53

subtypes

Front 54

type constructors

Back 54

cartesian product, union, power set ,subsets, function set, intersection, difference, complement

Front 55

sets with no duplicates. membership, insertion, deletion, union, intersection, difference

Back 55

unordered distinct values

Front 56

small universe

Back 56

bitwise implementation

Front 57

large universe

Back 57

hash implementation

Front 58

**some languages has strict restrictions on what the index can be and when it must be known

Back 58

index rules

Front 59

index range is fixed and storage is allocated at compile time

Back 59

static

Front 60

index ranges are fixed and statically bound but allocation happens at declaration

Back 60

fixed stack dynamic

Front 61

both index range and allocation are done at ran time. once allocated they remain fixed for their lifetime

Back 61

stack dynamic

Front 62

truly dynamic

Back 62

heap dynamic