freepeople性欧美熟妇, 色戒完整版无删减158分钟hd, 无码精品国产vα在线观看DVD, 丰满少妇伦精品无码专区在线观看,艾栗栗与纹身男宾馆3p50分钟,国产AV片在线观看,黑人与美女高潮,18岁女RAPPERDISSSUBS,国产手机在机看影片

正文內(nèi)容

《編譯原理概述》ppt課件-預(yù)覽頁

2025-01-01 05:40 上一頁面

下一頁面
 

【正文】 1 means indirect register addressing ? We assumed that the machine performs byte addressing. ? Integers occupy two bytes of memory. MOV R0, index 。 a identifier [ left bracket index identifier ] right bracket = assignment 4 number + plus sign 2 number The Parser ? Receives the source in form of tokens. ? Performs syntax analysis – determines the structure of the program – similar to performing grammatical analysis on a sentence in natural language. ? The result is represented as a parse tree or a syntax tree. Parse Tree expression assignexpression expression expression = subscriptexpression additiveexpression expression expression expression expression [ ] + identifier a identifier index number 4 number 2 Abstract Syntax Tree An abstract syntax tree is a condensation of the information contained in a parse tree. assignexpression subscriptexpression additiveexpression identifier a identifier index number 4 number 2 The Semantic Analyzer ? The semantics of a program are its “meaning”. ? The semantics of a program determine its runtime behavior. ? Most programming languages have features (called static semantics) that can be determined prior to execution. ? Typical static semantics features – Declarations – Type checking ? The extra information puted by the semantic analyzer are called attributes. – They are added to the tree as annotations, or “decorations” Annotated Tree assignexpression subscriptexpression integer additiveexpression integer identifier a array of integer identifier index integer number 4 integer number 2 integer The Source Code Optimizer ? The earliest point at which optimization steps can be performed is just after semantic analysis. ? There may be possibilities that depend only on the source code. ? Compilers exhibit a wide variation in the kind of optimization and its placement. ? The output of the source code optimizer is the intermediate representation (IR) or intermediate code. Example ? 4 + 2 can be preputed by the piler. – This optimization is known as constant folding. – This optimization can be performed on the annotated syntax tree by collapsing the right hand subtree to its constant value. assignexpression subscriptexpression integer number 6 integer identifier a array of integer identifier index integer The Code Generator ? The code generator takes the intermediate code or IR and generates code for the target machine. – We will write target code in assembly language form. Most pilers generate object code directly. ? The properties of the target machine bee important. – Use instructions of the target machine. – Data representations: how many bytes or words integer and floatingpoint data types occupy in memory. Example ? amp。a 。 value of index R0 SHL R0
點(diǎn)擊復(fù)制文檔內(nèi)容
教學(xué)課件相關(guān)推薦
文庫吧 www.dybbs8.com
備案圖鄂ICP備17016276號(hào)-1