Show:
Syntax
Semantics
Lexers
Parsers
Haskell
100
A formal language generation mechanism
What is a Grammar?
100
The type of semantics that expresses what can be proven about a language
What is Axiomatic Semantics?
100
A lexical analyzer
What is a lexer?
100
This type of Parser scans from left to right and the left most derivation is generated
What is an LL Parser
100
takes a homogenous data structure that stores several elements of the same type
What is a list?
200
The abstractions in a BNF grammar
What is a non-terminal
200
The type of Semantics that involves a mathematical object, and the mapping of language entities onto this object
What is Denotational Semantics
200
a language that can be described using regular expressions
What is a regular language?
200
All the children of the internal nodes of a partially defined Parse tree
What is a Phrase?
200
Haskell is this type of programming language
What is a functional programming language?
300
These are computed using semantic functions which depend only on the values of attributes of child nodes
What are synthesized attributes?
300
A logical expression on variables in a program which must hold true
What is an assertion?
300
a directed graph, wherein nodes are labelled with state names, and arrows are literals or tokens to be consume
What is state diagram?
300
A recognizer for a context-free language
What is a pushdown automaton?
300
The Haskell compiler commonly known by the abbreviation GHC
What is the Glasgow Haskell Compiler?
400
All the terminals in a parse tree are found in these
What are leaves
400
the rule of axiomatic semantics that expresses the notion a post condition can alway be weakened and a precondition can always be strengthened
What is the Rule of consequence
400
Also called a parser. This creates a parse tree
What is Syntax analyzer?
400
The left most simple phrase of any rightmost sentential form
What is a handle?
400
takes a function and a list and applies that function to every element in the list, producing a new list
What is map?
500
a rule that has the empty string as its RHS (right hand side)
What is an erasure rule?
500
the lowest level of operational semantics concerned with state changes the program undergoes as each statement is executed
What is structural operational semantics
500
A computer programming language is said to adhere to this if blocks in that language are expressed by their indentation
What is the off-side rule?
500
The original LR algorithm was designed by this man
Who is Donald Knuth
500
All functions in Haskell that accept several parameters are this type of function
What is a curried function?