Finally, a result about lazy sequences lseq, and the functio…

Finally, a result about lazy sequences lseq, and the functions numbers and take defined as in the notes. Consider the function qqq of type       ‘a lseq -> ‘a lseq -> ‘a lseq  defined bylet rec qqq z w = match z with | Nil -> w | Cons(x, sf) -> Cons(x, fun () -> qqq w (sf ())) List the result of evaluating    take 3 (qqq (numbers 4) (numbers 1))

Remember that for parsing expressions, we may write a gramma…

Remember that for parsing expressions, we may write a grammar where operators are left-associative, with rules such as     ::= ‘-‘ or we may write a grammar where operators are right-associative, with rules such as       ::= ‘-‘ For each purpose below, pick the grammar most suitable.