2014compiler课件ch112013章节.pptVIP

Homework 1.2 Given the C assignment a[i+1] = a[i] + 2 draw a parse tree and a syntax tree for the expression, using the similar example as a guide. 0型文法：也叫短语结构文法或无限制文法，其描述能力相当于图灵机，可使用任何的语法描述形式； 1型文法：也叫上下文有关文法，其描述能力相当于线性有界自动机，语法形式如下： xSy - xAy 也就是说，S推导出A是和上下文x, y相关的，即S只有在上下文x, y的环境中才能推导出A; 2型文法：也叫上下文无关文法，其描述能力相当于下推自动机，语法形式如下： S - A S可以无条件的推导出A，和上下文无关，上下文无关文法因此得名; 3型文法：也叫正则文法，等价于正则表达式，其描述能力相当于有穷自动机，语法形式如下： S - Aa 其中最后一个a必须为非终结符。 * * Tanvir Chapter 1 Introduction Computer Science Technology Harbin Engineering University 1.1 Why Compilers? Compilers 编译器 Compilers are computer programs that translate one language to another . Very complex program from 10,000 to 1,000,000 lines of code. Its input is a program written in its source language. Usually, the source language is a high-level language (C, C++, etc). It produces an equivalent program written in its target language. The target language is object code (machine code) for the target machine. Compilers 编译器 Simple example: The source program of a compiler is as follows. I := I0+ L* 2 Target program: the output of compiler is an equivalent machine code of its source program. It looks like these. . MOVF id3, R2 MULF #2.0, R2 MOVF id2, R1 ADDF R2, R1 MOVF R1, id1 Machine Language 机器语言 Initially, the programs were written in machine language. numeric codes that represented the actual machine operations to be performed. C7 06 0000 0002 moves number 2 to the location 0000. Writing such codes is time consuming and tedious. Assembly Language 汇编语言 In assembly language instructions and memory locations are given symbolic forms. MOV X, 2 An assembler translates the symbolic