Compiler Construction quiz 2

In regular expression 'S' is defined as:

• set of strings

• epsilon

• both

• none

A___________ accept a string if we can follow transition labelled with characters in the string from start state to same accepting string.

• regular expression

• finite automaton

• state

• none

We can build finite automaton based on the definition of _____________

• Finite state

• Regular expression

• both

• none

The input to the syntax analyzer is _________

• token stream

• syntax stream

• both

• none

The syntax of source language is described by _____________

• context free grammar

• regular experssion

• finite automata

• none

The context free grammar is a collection of four tuple, known as_______

• VTPS

• WTPS

• TPSS

• ALL

In __________ we are actually defining set of rules which helps us to make string we called language.

• regular expression

• context free grammar

• finite automata

• all

V is a set of ____________

• Terminal

• Non Terminal

• Both

• none

In ____ built production rules using non terminal and terminal symbols.

• V

• T

• P

• S

T is a set of ______ used to form language contructs.

• tereminal

• non terminal

• both

• none