Write a clearly legible T to the left of each of the following that is true, and a clearly legible F to the left of each that is false.
An implementation of a programming language is not an adequate definition of the language. Why not? What would be the consequences of using an implementation as a definition?
What is an important advantage of the linked representation of sequences over the sequential representation?
What is an important advantage of the sequential representation of sequences over the linked representation?
Show that the following BNF grammar is ambiguous. The start symbol is <S>.
<S> ::= <S> a | a <S> | a
Show a parse tree for string aacacab according to the following grammar, where the start symbol is <S>.
<S> ::= <F> a <S> | b <F> ::= a <F> | c
Write a BNF grammar for sequences of left and right parentheses that are balanced. A sequence of parentheses is balanced if parentheses match and are well nested. For example, (()(())) is balanced, but )( and ())()( are not balanced.
What is a solution for x and y to pattern match equation (x+1)::y = [3,4,5,6]?