Cumulative Flashcards
Adding a feature to a programming language to make it easier to do something that was already doable is called adding ANSWER.
syntactic sugar
Matz, the creator of Ruby thinks that it is less important to optimize the execution (efficiency) of a programming language and more important to optimize the efficiency of ANSWER
the programmers
A programming language is called ANSWER if it is executed by an interpreter rather than by first being compiled with a compiler.
interpreted
If the types of a programming language are bound at execution time rather than compile time, then the types are called ANSWER.
dynamically typed
In describing the properties of an object oriented language, encapsulation means ANSWER.
Data and behaviour are packaged together
In discussing object oriented languages objects are organized into a class tree to support the property of ANSWER.
inheritance
In discussing object oriented languages being able to handle objects of related type is called ANSWER.
Polymorphism
(Polymorphism has a different usage in the object oriented programming community than in the functional programming community)
The application that caused a significant increase in the popularity of Ruby was a web framework called ANSWER.
Rails
The concurrency approach used in Ruby is ANSWER.
threads
The command name for the ruby interpreter is ANSWER.
irb
In ruby true.class returns ANSWER
TrueClass
Ruby supports two common ways that boolean expressions are handled in programming languages. In one approach both subexpressions of a boolean operator are evaluated before the boolean operator is evaluated. In the other approach called ANSWER the first subexpression in a boolean expression is evaluated and if that is enough to know the result of the boolean expression, then the second subexpression is not evaluated.
short-circuit evaluation
In Ruby, normally when you try to add a String to a Fixnum, you get an error message saying that a String cannot be coerced to a Fixnum. This is because Ruby is ANSWER typed.
strongly
One way of checking types is to see what constructor was used to create an object that is a parameter. Another way of checking types is to wait until a method is sent to an object and see if it supports the methods. This second way is called ANSWER.
duck typing
A major claim in object oriented design philosophy is that you should code to ANSWER rather than code to implementation.
interface
The & notation in the line of Ruby def gerorge(&sam) is used to indicate that sam is ANSWER.
a code block
The : notation in the Ruby expressions :hi is used to indicate that hi is ANSWER.
a symbol
With respect to the value returned by the Ruby expression:
‘hi’ .object_id == ‘hi’ .object_id
You can say it ANSWER.
could be either true or false
With respect to the value returned by the ruby expression:
:hi.object_id== :hi.object_id
You can say it ANSWER.
will always be true
To execute a code block in Ruby that is passed to a method but does not appear on its parameter list, you use the keyword ANSWER.
yield
To execute a codeblock in Ruby that is passed to a method on its parameter list, you send that parameter the method ANSWER.
call
A code block is some lines of code surrounded by either curly braces or ANSWER.
do end
In Ruby the expression Fixnum.class returns ANSWER.
Class
The root of the inheritance hierarchy in Ruby is the class ANSWER.
Object (According to textbook in 2010)
BasicObject (Updated answer for Ruby 2.3)
In Ruby, the name of the method in the class Me that is automatically invoked when a new object of type Me is created with Me.new is ANSWER.
initialize
In Ruby, the @ is used to indicated that the variable @me is ANSWER.
an instance variable
In Ruby, the @@ is used to indicate that the variable @@me is ANSWER.
a class variable
In Ruby, by convention the ? in the method me? is used to indicate that me is ANSWER.
boolean
In Ruby, the mixin is used to solve the object-oriented programming problem of ANSWER.
multiple inheritance
The feature of programs being able to ‘write programs’ (creating application specific language features) is called ANSWER.
metaprogramming
In Ruby, if you declare a class with a class name that is already in use and put in it the definition of a new method, you have changed the functionality of the existing class (even if it is a predefined class like Fixnum). The property of Ruby that allows this is ANSWER.
open classes
When you send a message to a Ruby object, Ruby first looks at the methods that object supports, and then starts working the inheritance chain. If it still cant find the appropriate method, the message and its parameters get passed as a message to the object looking for a method called ANSWER.
method_missing
In the Ruby community, the acronym DSL is an abbreviation for ANSWER.
domain specific language
In Ruby, if a line starts with a method name, that method is being sent to the object named ANSWER.
self
When you define a method in a class, normally it is meant to be invoked on an object of that class (an instance method). Sometimes it is meant to be invoked on the class name itself (a class method), like Date.parse( ‘3rd Feb 2001’). In Ruby, to define a class method we put ANSWER at the beginning of the method name in its definition.
self
Scala was designed to connect two programming paradigms, which were ANSWER.
object-oriented and functional
Another design goal for Scala was to have its programs easily interoperate with those written in ANSWER.
Java
Scala is ANSWER typed.
statically
Scala uses few type declarations because its compiler does ANSWER.
type inferencing
The main concurrency method used in Scala is ANSWER.
actors
In Scala, to indicate that a variable is immutable, you introduce it with the ANSWER keyword.
val
In Scala, to indicate that a variable is mutable, you introduce it with the ANSWER keyword.
var
In Scala, if I want to redefine a method that is defined in my parent class, I indicate this by using the keyword ANSWER.
override
The Scala feature closest to a Ruby mixin is the ANSWER.
trait
In Scala, the type that every type is a subtype of is called ANSWER.
Any
In Scala, the type that is a subtype of every type is called ANSWER.
Nothing
Many programming languages represent internal constants for types like strings, floats, and integers. Scala has the unusual distinction of having an internal constant representation for the type ANSWER, which is normally viewed as a format external to a program.
XML
The ! in Scala is used to ANSWER.
Send a message to an actor
In the chapter on Scala, we get the following interesting quote: ANSWER is the most important thing you can do to improve code design for concurrency.
Immutability
Instead of the + symbol, Haskell uses the symbol ANSWER for a string concatenation operator
.
++
The type of a string constant in Haskell by default is written ANSWER.
[Char]
In Haskell, you use the keyword ANSWER to collect related code into a similar scope.
module
In Haskell, if I define a function double x = x + x its type signature would be ANSWER.
(Num a ) => a -> a
In Haskell, instead of writing something like if x ==0 then 1 else fact (x-1)*x, you can write a series of lines starting with factorial 0 = 1. This second style is called ANSWER.
pattern matching
In Haskell, instead of writing something like if x==0 then 1 else fact (x-1) x, you can write a series of lines starting with | x > 1 = x factorial (x-a). This second style is called ANSWER.
using guards
In Haskell, instead of writing something like second x = head(tail(x)), you can write this without introducing the parameter x by using function composition. Doing that, you would define second by ANSWER.
second = head . tail
In Haskell, if I write (h:t) = [3 , 5 ,7], ANSWER is the value of h.
3
In Haskell, if I write (h:t) = [3, 5, 7], ANSWER is the value of t.
[5,7]
In Haskell, ANSWER is the output of zip [17…20] [10 , 8 ….4].
[(17,10),(18,8),(19,6), (20,4)]
In Haskell, ANSWER is the output of zip [20….17] [10,8…4]
[]
Default increment is 1 and zip only goes as far as shortest argument list
In Haskell, the anonymous function ANSWER causes the expression ‘map ANSWER [1,2,3]’ to produce [-4, -5, -6].
(\x-> - (x+3))
In Haskell, if we want to define a local named function inside a function definition, we use the keyword ANSWER.
where
In Haskell, the type signature of the function sum x y = x + y is ANSWER.
(Num a ) => a -> a -> a
In Haskell, given the definition sum x y = x + y, ANSWER is the value of that is produced by the expression (sum 3).
(\x -> 3 + x)
The way Haskell handles functions with more than one parameter is called ANSWER.
currying
In most languages, a function definition like f a b = a : (f (a + b) b) would result in an infinite recursion. However, in Haskell we can partially evaluate functions like this because Haskell is based on ANSWER.
lazy evaluation
Although Haskell is a statically typed language, we usually don’t need to write type declarations because Haskell uses ANSWER to handle the matter.
type inference
In Haskell, we can declare the type of a parameter to a function to be something specific like Num. However, we can also declare the type of a parameter to be something that could include many types like ListLike that supports the functions head and tail. We do this with a definition of ListLike that begins with the keyword ANSWER.
class
One of the three most significant parts of a monad is called ANSWER, which wraps up a function and puts it in the container.
return
One of the three most significant parts of a Haskell monad is called ANSWER, which unwraps up a function.
> > =
a bind function
In Haskell’s do notation for working with monads, assignment uses the ANSWER operator.
(left arrow)
Since Haskell doesn’t have traditional error handling mechanisms, by convention, people use the ANSWER monad to distinguish a valid return from an error return.
Maybe
This is similar to NaN’s usage in IEEE standard floating point arithmetic
Haskell, defining lists using a notation like [x*2 | x (left arrow) [3,4,5]] is called using ANSWER.
list comprehesions
In Haskell, [x*2 | x (left arrow) [3,4,5]] evaluates to ANSWER.
[6, 8, 10]
In Prolog, the most natural way to express the fact that a lion is a cat is ANSWER.
cat(lion)
In Prolog, the most natural way to express the query “what animals are cats?” is ANSWER.
animal(What), cat(What)
In Prolog, the most natural way to express the rule that “I am an ancestor of you if I am a parent of you” is ANSWER.
ancestor(I, You) :- parent(I, You)
In Prolog, the most natural way to express the rule that “I am an ancestor of you if I am a parent of an ancestor of you” is ANSWER.
ancestor(I, You) :- parent(I, Ancestor), ancestor(Ancestor, You)
(Both lines are one answer)
In Prolog, the expression hi(X, 4) = hi(3, Y) causes X to have the value ANSWER.
3
In Prolog, the expression hi(X, 4) = hi(3, Y) causes Y to have the value ANSWER.
4
In Prolog, the expression hi(X, 4) = hi(3, X) causes X to have the value ANSWER
X will not be bound
In Prolog, the expression [1, 2, 3] = [X | Y] causes X to have the value ANSWER.
1
In Prolog, the expression [1, 2, 3] = [X | Y] causes Y to have the value ANSWER.
[2, 3]
In Prolog, the expression X = [[1,2] | [3,4]] causes X to have the value ANSWER.
[[1, 2], 3, 4]
In Prolog, the expression X = 1 + 2 causes X to have the value ANSWER.
1+2
In Prolog, the expression 2 = 1 + X causes X to have the value ANSWER.
X remains unbound
In Prolog, the expression that would cause an unbound variable X to take on the sum of the values of a bound variable Y and a bound variable Z is ANSWER.
X is Y + Z
In Erlang, the main approach to concurrency is ANSWER.
actors
In the Erlang community, ANSWER code refers to replacing pieces of your application without stopping your application.
hot-swapping
An unusual built-in constant construct in Erlang lets us write «4:3,1:3» to represent the value ANSWER.
!
octal 41
decimal 33
hexidecimal 21
Many syntax features of Erlang, such as ending statements with a period, reflect the influence of the programming language ANSWER.
Prolog
In Erlang, you can link two processes together. Then when one dies, it sends ANSWER to its twin.
an exit signal
The main programming paradigm in Erlang is ANSWER programming.
functional
In Ruby, you would group methods into a class. In Erlang, you group functions into ANSWER.
a module
The idea that when a process has an error, it is up to a monitoring process to determine what to do about the problem is referred to by the motto ANSWER in Erlang.
Let it crash
Unlike most Lisp systems, Clojure doesn’t use its own custom virtual machine. It was originally designed to compile to code that would run on the ANSWER.
JVM
Java Virtual Machine
The main programming paradigm for Clojure is ANSWER programming.
functional
The loop and recur constructs are in Clojure to guide ANSWER.
tail recursion optimization
tail recursion elimination
In Clojure, the value of (repeat 1) is ANSWER.
an infinite sequence of 1s
a lazy infinite sequence of 1s
In Clojure, (take 3 (iterate (fn [x] (* 2 x)) 2)) produces ANSWER.
(4 8 16)
The main Clojure approach to concurrency is called ANSWER.
Software Transactional Memory
STM
In Clojure, ANSWER is a concurrency construct that allows an asynchronous return before computation is complete.
a future
In Clojure, you cannot change a reference outside of ANSWER,
a transaction
Three concepts related to concurrency were discussed with regards to the language Io. ANSWER was presented as a way to manage two execution streams that pass control back and forth between themselves.
coroutines
Three concepts related to concurrency were discussed with regards to the language Io. ANSWER was presented as a general mechanism for sending a message to an object that would cause that object to respond to the message as a separate process running asynchronously.
Actors
Three concepts related to concurrency were discussed with regards to the language Io. ANSWER was presented as a way to request that something be computed and then be able to continue computing until the result was needed. If the result was available then things would proceed as expected. If the result was not available, then a wait would be initiated until the result became available.
Futures
Io is known for taking a ANSWER-based approach to object oriented programming.
prototype
In Io, the basic method for creating a new object is ANSWER.
clone
In Io, the type of an object is generally the nearest ancestor that ANSWER.
has a name that starts with a capital letter
has a slot for the method type
In Io, we create a singleton by redefining the method ANSWER.
clone
In Ruby, the evaluation of arguments to a message are handled by the object sending the message. In Haskell, the runtime environment decides when and how much to evaluate an argument to a function. In Io, the evaluation of the arguments to a message is made by ANSWER.
the receiver of the message
In Io, a message has three aspects that can be interrogated by the call method. They are: the sender, the reciever, and ANSWER
the argument list
Io allows programmers to play with its syntax, doing things like introducing a colon operator and redefining how curly braces are processed. This makes it easy to use Io to create ANSWER.
Domain Specific Languages
DSLs
As one would expect in an object oriented language, when a message is sent to an object, the first thing the system does is to look for a corresponding method in that object. However, Io lets you change what happens next by redefining the method named ANSWER.
forward
When viewing programming languages as natural languages, the word ANSWER is used instead of `words’.
tokens
The routine in a compiler that takes as input a sequence of characters outputs these characters grouped into meaningful units is called ANSWER.
a lexical analyzer
The specifications for how to group characters into meaningful units are traditionally written as ANSWER.
regular expressions
The specifications of how to group characters into meaningful basic units of a programming language are generally implemented in code that has the abstract form of ANSWER.
a finite state machine
When viewed abstractly, a language is defined as a set of ANSWER.
strings
The Greek letter epsilon, when talking about languages, is used to represent ANSWER.
the empty string
In automatically generating the code that reads characters and outputs the part of a programming language that is analogous to its words, we start with a specification and then traditionally convert it into code in two stages. In the first stage, we produce ANSWER.
a nondeterministic finite state machine
In automatically generating the code that reads characters and outputs the part of a programming language that is analogous to its words, we start with a specification and then traditionally convert it into code in two stages. The main problem that can arise in moving from the first stage to the second stage is ANSWER.
an exponential explosion in the number of states needed
The central idea of context-free grammars is to define a language by productions. These productions say that a nonterminal symbol can be replaced by ANSWER.
a sequence of terminals and nonterminals
a sequence of symbols
The specific type of grammar that was the main focus of the portion of the Syntax Analysis chapter that was assigned was ANSWER.
LL(1)
In a context-free grammar, the nonterminal that derives an entire member of the language being defined is called ANSWER.
a start symbol
Using the context-free grammar based on the two rules A -> b A and A -> b, ANSWER would be the derivation sequence for bbb.
A => Ab => Abb => bbb
ANSWER is the regular expression that corresponds to the language defined by the context-free grammar with the three rules A -> A a, A -> A b, A -> a.
a (a | b)*
That’s the bar, not a letter in between
ANSWER would be the derivation of ((1)) in the language defined by the context-free grammar consisting of the two rules E -> ( E ) and E -> 1.
E => (E) => ((E)) => ((1))
ANSWER are two derivations of the string cc that produce distinct syntax trees from the context-free grammar X -> X c Y , Y -> X, Y -> and X -> .
X => XcY => XcYcY => cYcY => ccY => cc
AND
X => XcY => XcX => XcXcY => cXcY => ccY => cc
When a grammar can produce two distinct syntax trees for the same string, the grammar is said to be ANSWER.
ambiguous
If I wanted to fix the grammar E -> E + E and E -> id, so that it would only produce one syntax, which is left recursive, the new grammar would be ANSWER.
E -> E + F and E -> F and F -> id
E -> E + F and E -> id and F -> id
One aspect of the if then else end syntax of Ruby is that it avoids the ANSWER problem.
dangling else
In the context-free grammar A -> B A , B -> A B, A -> B, A -> a, B -> b, and B -> the value of Nullable(A) is ANSWER.
true
In the context-free grammar A -> B A , B -> A B, A -> a, B -> b, B -> the value of Nullable(A) is ANSWER.
false
In the context-free grammar A -> B A , B -> A B, A -> B, A -> a, B -> b, and B -> the value of FIRST(A) is ANSWER.
{a,b}
In the context-free grammar A -> B A , B -> A B, A -> a, B -> b, B -> the value of FIRST(A) is ANSWER.
{a,b}
In the context-free grammar A -> B A , B -> A B, A -> B, A -> a, B -> b, and B -> the value of FOLLOW(A) is ANSWER.
{a,b}
In the context-free grammar A -> B A , B -> A B, A -> a, B -> b, B -> the value of FOLLOW(A) is ANSWER.
{b}
The context-free grammar A -> B A , B -> A B, A -> a, B -> b, B -> is not LL(1) specifically because ANSWER.
FIRST(BA) and FIRST(a) both include a, so we do not know which A rule to use
When you write a parser for a context-free grammar that satisfies the LL(1) criteria by representing each non-terminal by a function that chooses what functions to invoke by the LL(1) criteria, this sort of parser is called ANSWER.
a recursive descent parser
Programming languages that view programming as describing a step-by-step process to do something are called ANSWER languages.
imperative
Programming languages that view programming as describing characteristics of the problem domain and characteristics of the solution and leaving it to the language processor to find a solution are called ANSWER languages.
declarative
Each named object will have ANSWER, where the name is defined as a synonym for the object.
a declaration
The technical term for connecting a name with an object is called ANSWER.
binding
The portion of the program where the name is visible is called its ANSWER.
scope
When the structure of the syntax tree is used to determine which object corresponds to a name, this is called ANSWER.
static scoping
A compiler typically keeps track of which names are associated with which objects by using ANSWER.
a symbol table
ANSWER data structures have the property that no operation on the structure will destroy or modify it.
immutable
ANSWER data structures have the property that there are operations on the structure can destroy or modify it.
mutable
Since a compiler may have to look up what object is associated with a name many times, it is typical to use ANSWER to avoid linear search times.
hash tables
In the example interpreter for evaluating expressions, in the row labelled id, we have the code: v = lookup(vtable, getname(id)) ; if v = unbound then error() else v. It says getname(id) instead of id, because ANSWER.
id indicates a token with a type and value field
In the example interpreter for evaluating expressions, in the row labelled id, we have the code: v = lookup(vtable, getname(id)) ; if v = unbound then error() else v. The value of v would be unbound in the situation that ANSWER.
getname(id) was not bound
In the ICD textbook’s example interpreter for evaluating expressions, in the row labelled id(Exps), we have the code: args = EvalExps(Exps,vtable,ftable). We pass vtable to EvalExps to handle ANSWER.
expressions that contain identifiers
In the ICD textbook’s example interpreter for evaluating expressions, in the row labelled id(Exps), we have the code: args = EvalExps(Exps,vtable,ftable). We pass ftable to EvalExps to handle ANSWER.
expressions that contain function usages
In the ICD textbook’s example interpreter for evaluating expressions, in the row labelled let id = Exp1 in Exp2, we have the code: v1 = EvalExp(Exp1, vtable, ftable); vtableP = bind(vtable, getname(id), v1), EvalExp(Exp2, vtableP, ftable). The bind function changes vtable into vtableP by ANSWER.
inserting the binding of getname(id) with the value v1 into the table
One approach to speeding up an interpreter is to translate pieces of the code being interpreted directly into machine code during program execution, this is called ANSWER.
just-in-time compilation
The technical term for the compiler design methodology where the translation closely follows the syntax of the language is ANSWER.
syntax-directed translation
Using the straightfoward expression translation scheme in the ICD 2nd edition textbook, if I were to TransExp(‘3 * x + 1’, vtable, ftable), newvar() will be invoked ANSWER times.
5
Using the straightfoward statement translation scheme in the ICD textbook, if I were to TransStat(‘if true then z := 1 else z := 2’, vtable, ftable), newlabel() will be invoked ANSWER times.
3
Using the straightfoward statement translation scheme in the ICD textbook, if I were to TransStat(‘while true do z := 1 + z’, vtable, ftable), newlabel() will be invoked ANSWER times.
3
Using the straightfoward statement translation scheme in the ICD textbook, if I were to TransStat(‘while z < 3 do z := 1 + z’, vtable, ftable), newvar() will be invoked ANSWER times.
5
When type checking done during program execution, the type system is called ANSWER.
dynamic typing
When type checking done during program compilation, the type system is called ANSWER.
static typing
ANSWER typing is when the language implementation ensures that the arguments of an operation are of the type the operation is defined for.
Strong
ANSWER is the data structure used in language translation to track the binding of variables and functions to their type.
A symbol table
The different traversals of a syntax tree done during compilation associate information with the nodes of the tree. The technical term for this kind of information is ANSWER.
attributes
ANSWER means that the language allows the same name to be used for different operations over different types.
Overloading
Some languages allow a function to be ANSWER, that is to be defined over a large class of similar types, e.g., over arrays no matter what type their elements are.
polymorphic
generic
When a function is invoked, if the language passes a copy of the value of each parameter to the code that performs the function, this is called ANSWER.
pass-by-value
If the system stack is used for a call stack, then it becomes important for the caller to update the top of the stack before copying items into it. The reason is because we are worried about the top of the stack being changed by ANSWER after we have copied in information but before we updated the stack top.
an interrupt
The portion of the call stack associated with a single function invocation and execution is called ANSWER.
an activation record
Another method of parameter passing, whose technical name is ANSWER, is implemented by passing the address of the variable (or whatever the given parameter is). Assigning to such a parameter would then change the value stored at the address.
pass-by-reference
In C, when you pass a function as a parameter to another function, it is implemented as passing ANSWER.
the address of the start of the function code
The practice of rewriting existing code to improve its design is called ANSWER.
refactoring
ANSWER is the name of the code smell for when an instance method doesn’t rely on the state of the instance.
utility function
ANSWER is the name of the code smell for when the same two or three items frequently appear together in classes and parameter lists, or when a group of instance variable names start or end with similar substrings.
data clump
When you have two or three items that frequently appear together, the first step in fixing the problem is generally ANSWER.
put them in their own object
The code smell called ANSWER occurs when a code fragment references another object more often than it references itself.
feature envy
A popular Phil Karlton quote is: There are only two hard things in computer science - cache invalidation and ANSWER.
naming things
A class that publishes a getter or setter for an instance variable invites client classes to commit the code smell called ANSWER.
inappropriate intimacy
The prof thinks code should be broken into small pieces in order to make ANSWER easier.
re-using the code
Among other reasons
Scalastyle was originally flagging println as bad practice because in most production code, the usage of println you see is debug messages and people should be using ANSWER instead.
a logging package
The reason scalastyle complains about methods returning null can be seen by considering the type system of Scala. If I have a function that tests a parameter x to see if it is less than 3 and returns 2 if the test is true and null if the test is false, the type of the return value of the function would be ANSWER.
any
The reason scalastyle complains about methods using return also has to do with the type system of Scala. If in the Scala repl if I define a parameterless function f as equal to 3, then f is of type Int. However, if I instead define the function to be equal to return 3, I get an error message telling me that f ANSWER.
needs a result type
