Compiler Front-End Analysis

Which of the following BNF rules uses recursion?

• <Number> ::= <Digit> | <Digit><Number>

• <Name> ::= <Forename><Surname>

• <Age> ::= <Digit>|<Digit><Digit>

• <Name> ::= <Name>

Choose all the valid variables sequences that match these BNF rules ...

• C

• F9

• X,AB1,Z2

• 1,2,3,4

• A,B,C,D

Choose all the valid expressions that are recognised by this set of BNF rules ...

• 4+75*3

• 9

• 99-76/2+3

• 4*5*6*7

• 2+2

Choose all the valid expressions that are recognised by this set of BNF rules ...

• a-b

• a+b*c

• a*b*c

• ab+c

Which are part of compiler front-end analysis?

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• spelling analysis

Which part breaks the line of code into tokens?

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• code optimization

Which part breaks creates the symbol table?

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• code optimization

Which part breaks checks the grammar of the source code?

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• code optimization

Which part breaks uses BNF or syntax diagrams?

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• code optimization

Which part makes sure that the data type of the variables fit into the code.

• lexical analysis

• syntax analysis

• semantic analysis

• intermediate code generation

• code optimization