Focus
Planner
News
Login
Get Started

COMPILERS

compilers

Exit

Question 1 of 1

Time Left

0

203264

0

120

block

Translation from human-readable mnemonics to machine instructions in binary

Fill in the blanks

(0/0)

0

1

203265

0

120

none

translate binary to human readable

Fill in the blanks

(0/0)

0

1

203266

0

120

none

Productions in grammar can be systematically transformed to

Select the correct answer(s).

(0/0)

0

1

2

3

4

2

203267

0

120

none

Production with identical first parts on rhs can be written as equivalent, unambiguous grammar with distinct first parts

Fill in the blanks

(0/0)

0

1

203268

0

120

none

2(right recursive productions) =

Fill in the blanks

(0/0)

0

1

203270

0

120

none

FINITE STATE MACHINE

Select the correct answer(s).

(0/0)

0

1

2

3

4

5

6

7

5

203136

0

120

none

Production rules

Match the text (click and drag)

(0/0)

0

Match the text
LHS --> RHS
STRONGLY TYPED
Terminals

0

1

2

3

Click and drag
Replace left hand side with right hand side
puts extra constraints on the languages, Spoken languages are weakly typed
words that occur in the language

3

203144

0

120

none

Grammar

Match the text (click and drag)

(0/0)

0

Match the text
Sentence symbol
Production rules
Non-terminal symbols
Terminal symbols
Grammar

0

1

2

3

4

5

Click and drag
constants in grammar, appear in leaves of parse tree
LHS --> RHS
4 tuple - <S,P,N,T>
starting point
variables in a grammar, appear in branches of parse tree

5

203146

0

120

none

Language types

Match the text (click and drag)

(0/0)

0

Match the text
TYPE 0 LANGUAGE
TYPE 1 LANGUAGE
TYPE 2 LANGUAGE
TYPE 3 LANGUAGE

0

1

2

3

4

Click and drag
abc --> adc, context sensitive, can't change terminals (more restricted)
a --> b, free grammar, possible to change terminals
a-->b \| a-->bc, finite regular grammar, most lexical analysers are this type
a-->b, context free grammar, deterministic - don't backtracK, computer languages are this type

4

203151

0

120

none

A __________ checks if somethings valid

Fill in the blanks

(0/0)

0

1

203154

0

120

none

Recognisers

Select the correct answer(s).

(0/0)

0

1

2

1

3

4

2

203156

0

120

none

A RECOGNISER TO WHICH CODE GENERATION IS ADDED DESCRIBES A

Fill in the blanks

(0/0)

0

1

202913

0

120

none

Order of the stages of compilation

Match the text (click and drag)

(0/0)

0

1

2

3

4

5

6

Match the Text
1
2
3
4
5
6
7

0

1

2

3

4

5

6

7

Click and drag
Target code generation
Code optimisation
Parsing
Lexical analysis
Intermediate code generation
Pre-processing
Parse tree optimisation

7

203169

0

120

none

what type of parser is implemented by having one recursive procedure for each non-terminal symbol in the grammar

Fill in the blanks

(0/0)

0

1

203171

0

120

none

STATEMENT, TERM, EXPRESSION and FACTOR are parts of...

Fill in the blanks

(0/0)

0

1

Results

Correct

0 Incorrect

0 Skipped

0 Overall Percentage

0%

Saving quiz

Save Score

Rate Quiz

Save Rating

Exit

Correct Answer

You've answered correctly.

Answer Incorrect

You've answered incorrectly.

Out Of Time

You've ran out of time.

Save

To save scores or ratings you'll need to login or register.

Sign In

Register

Audio Settings

Language

Set the correct audio language for your text.

Danish Dutch English French German Icelandic Italian Japanese Korean Norwegian Polish Portuguese Romanian Russian Spanish Swedish Turkish Welsh

Highlighting

Improve your learning by highlighting words as they are spoken.

Word-By-Word Highlighting

Listen To Audio

You can play quizzes, courses and flashcards without needing to login. However to save scores and to make quizzes, courses and flashcards you'll need to be logged in. To play audio you'll need to be logged into a Professional Account.

Register Login

Listen To Audio

Take your learning to the next level. Upgrade to a Professional Account to hear your questions read aloud as well as enjoying many other benefits.

Audio is generated for any question or answer you create.

Many people learn better when they listen to what they're learning. For learning a foreign language we supported over 18 different languages.

Supported languages include Danish, Dutch, English, French, German, Icelandic, Italian, Japanese, Korean, Norwegian, Polish, Portuguese, Romanian, Russian, Spanish, Swedish, Turkish and Welsh.

We also support automatic word-by-word highlighting as words are read aloud.

Find Out More