SEMANTIC ANALYSIS

SEMANTIC ANALYSIS

1. The semantics corresponds to the meaning associated with Formal structures (syntax) of language.

   • corresponds to:
     • To the meaning associated with Formal structures (syntax) of language.
   • is also called:
     • Thus, it is traditionally called "semantic analysis" To everything that is part of the front [end-end]
   • this allow us:
     • - Table of symbols -Type Checks (and others) -Generation of internal representation
       • teable of symbols
         • The symbol table allows the lexical analyzer to return a different token according to the category of the identifier in that context.
       • the type cheks are:
         • A compiler must perform a series of checks Static, such as type checks: -Consistency: uniqueness, existence, non-cyclicity, ... -Type equivalence and compatibility Explicit [cast] or forced conversion [coercion] -Inference types (in values) -Overloading functions and operators -Polymorphic Functions
       • internal representations: Allow to uncouple the designs from each other.
         • oriented to:
           • -Its optimization (clear and simple instructions) -Generate code from different object machines. The design should allow its easy generation by the analyzer Semantic.