Editing Front-End

Jump to: navigation, search

Warning: You are not logged in.

Your IP address will be recorded in this page's edit history.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 1: Line 1:
http://adviainternet.com/buyzithromax/#60424 buy generic zithromax on - buy zithromax online australia
+
In a compiler, the ''Front End'' (FE) lexically analysis the source code to form tokens, which are syntactically analysed, converted to some internal intermediate representation and semantically checked.  
 +
 
 +
# '''Preprocessing''' - some languages (e.g., C language) include a preprocessor. This generally occurs before syntactic analysis.
 +
# '''Lexical analysis''' - breaking the source code text into small pieces ('tokens' or 'terminals'), each representing a single atomic unit of the language, for instance a keyword, identifier or symbol name. The token language is typically a regular language, so a finite state automaton constructed from a regular expression can be used to recognize it. This phase is also called lexing or scanning. The program doing lexical analysis is called a lexical analyzer or shortly a scanner.
 +
# '''Syntax analysis on parsing''' - Identifying syntactic structures of source code, also named Parsing and conducted by a parser. It only focuses on the structure. In other words, it identifies the order of tokens and understands hierarchical structures in code acording to the language.
 +
# '''Semantic analysis''' - Is to recognize the meaning of program code and start to prepare for output. In that phase, type checking is done and most of compiler errors show up. This happens in the parser.
 +
# '''Intermediate Representation''' - often briefed as IR, an equivalent to the original program is transformed to an intermediate representation. This can be a data-structure (typically a Tree or Graph) or an Intermediate language.
 +
# '''Symbol Table''' - Working with intermediate representation, symbol tables are auxiliary (optional) data structures where each symbol in a program's source code is associated with information such as location, type and scope level.
 +
 
 +
[[Category:Basic Concepts]]

Please note that all contributions to eplmediawiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Eplmediawiki:Copyrights for details). Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)
Personal tools
Namespaces

Variants
Actions
Navigation
extras
Toolbox