Question $2$: Answer the following question as true or false. Each wrong answer will count against you!

$[$each question is $2$ points$]$

In Haskell, variables must be declared and assigned before used

Abstract syntax tree can be used to compile and execute code

Shunting yard algorithm can only parse type $3$ grammars

Lexer produces lexemes for the parser

Type $1$ grammar category includes all grammars

Prolog is a strictly cased language with variables start with capital letters

In Haskell functions that perform I$/$O operations should be marked

EBNF is designed for natural languages