Application Generation
No description yet. This curated deck is ready for daily study.
Card preview (10)
name the stages of compilation
Lexical analysis Syntax analysis Code Generation Optimised
what happens at lexical analysis
comments and white spaces are removed keywords and identifiers are replaced with tokens symbol table is created out of the tokens code is prepared to the next stage.
define token
fixed binary length
what happens at syntax analysis
series of tokens is passed onto this stage code is checked if it follows the rules of the language i.e identifier - value not other way around tokens are places in a syntax tree errors reported in a list error diagnostics are given
What do linkers do
Combine the source code with the library code
what do loaders do
Load the exe file into memory
What is static linking
static linking involves combining the library code to the Source code in one Exe file
What is dynamic linking
Keeps the files separate by including the storage location of the library mentioned
How is a loader used if dynamic linking has taken place
Loads EXE file into memory and then searches for any libraries used based on the addresses mentioned in the EXE file