Back to marketplace

2.4 Programming language translators

No description yet. This curated deck is ready for daily study.

Total cards: 12•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (12)

#1
Front (Question)

Assembler

Back (Answer)

• Converts source/assembly code to bytecode (intermediate form) • The output is machine code (object code)

#2
Front (Question)

Instruction set

Back (Answer)

Machine code instructions that a particular computer can execute

#3
Front (Question)

Compiler

Back (Answer)

• Source code as input • Performs different checks • Converts source code to object code and can be run anywhere without the presence of a compiler

#4
Front (Question)

Interpreter

Back (Answer)

Each line is analysed, translated into machine code and ran one by one if it contains ono syntax errors

#5
Front (Question)

Bytecode

Back (Answer)

• Intermediate representation which combines compiling and interpreting • Executed by a bytecode interpreter

#6
Front (Question)

Advantages of bytecode and JVM

Back (Answer)

• Platform independence • Masks differences between different computer architectures and operating systems • Adds extra security layer between the computer and program

#7
Front (Question)

Advantages/Disadvantages of compilers

Back (Answer)

• Object code can be run whenever required without the need to recompile, however if an error is discovered in program has to be recompiled • Object code executes faster than interpreted code • Object code produced by compiler can be distributed without compiler present • Object code is secure and cannot be read without a great deal of ‘reverse engeneering’

#8
Front (Question)

Advantages/ Disadvantages of compiler

Back (Answer)

• Platform interdependence • No lengthy recompilation each time an error is discovered • Iterations have to be interpreted

#9
Front (Question)

Stages of compilation

Back (Answer)

• Lexical analysis • Syntax analysis • Code generation • Optimisation

#10
Front (Question)

Lexical analysis

Back (Answer)

• Removes superfluous spaces and comments • Checks for illegal identifiers • Replace keywords with tokens from a symbol table

#11
Front (Question)

Syntax and semantic analysis

Back (Answer)

• Compared to syntax diagrams • Parsing • Stacks are used to check brackets are correctly paired (reverse Polish notation) • Semantic of the program are checked

#12
Front (Question)

Code generation and optimisation

Back (Answer)

• Aim to reduce the execution time of the object progh