欢迎来到麦多课文档分享! | 帮助中心 海量文档,免费浏览,给你所需,享你所想!
麦多课文档分享
全部分类
  • 标准规范>
  • 教学课件>
  • 考试资料>
  • 办公文档>
  • 学术论文>
  • 行业资料>
  • 易语言源码>
  • ImageVerifierCode 换一换
    首页 麦多课文档分享 > 资源分类 > PPT文档下载
    分享到微信 分享到微博 分享到QQ空间

    Syntax Analysis(Section 2.2-2.3).ppt

    • 资源ID:389541       资源大小:322.50KB        全文页数:26页
    • 资源格式: PPT        下载积分:2000积分
    快捷下载 游客一键下载
    账号登录下载
    微信登录下载
    二维码
    微信扫一扫登录
    下载资源需要2000积分(如需开发票,请勿充值!)
    邮箱/手机:
    温馨提示:
    如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
    如需开发票,请勿充值!如填写123,账号就是123,密码也是123。
    支付方式: 支付宝扫码支付    微信扫码支付   
    验证码:   换一换

    加入VIP,交流精品资源
     
    账号:
    密码:
    验证码:   换一换
      忘记密码?
        
    友情提示
    2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
    3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
    4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
    5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。

    Syntax Analysis(Section 2.2-2.3).ppt

    1、Syntax Analysis (Section 2.2-2.3),CSCI 431 Programming Languages Fall 2003,A modification of slides developed by Felix Hernandez-Campos at UNC Chapel Hill,Review: Compilation/Interpretation,Compiler or InterpreterTranslation Execution,Review: Syntax Analysis,Compiler or InterpreterTranslation Execut

    2、ion,Source Code,Specifying the formof a programming languageTokens Regular Expressions (also F.A.s & Reg. Grammars)Syntax Context-FreeGrammars (also P.D.A.s),Target Code,Phases of Compilation,Syntax Analysis,Syntax: Websters definition: 1 a : the way in which linguistic elements (as words) are put t

    3、ogether to form constituents (as phrases or clauses) The syntax of a programming language Describes its form Organization of tokens Context Free Grammars (CFGs) Must be recognizable by compilers and interpreters Parsing LL and LR parsers,Context Free Grammars,CFGs Add recursion to regular expression

    4、s Nested constructions Notation expression identifier | number | - expression| ( expression ) | expression operator expression operator + | - | * | /Terminal symbols Non-terminal symbols Production rule (i.e. substitution rule) terminal symbol terminal and non-terminal symbols,Parsing,Parsing an arb

    5、itrary Context Free Grammar O(n3) Too slow for large programs Linear-time parsing LL parsers (a Left-to-right, Left-most derivation) Recognize LL grammar Use a top-down strategy LR parsers (a Left-to-right, Right-most derivation) Recognize LR grammar Use a bottom-up strategy,Parsing example,Example:

    6、 comma-separated list of identifierCFGid_list id id_list_tail id_list_tail , id_list_tail id_list_tail ;ParsingA, B, C;,Top-down derivation of A, B, C;,CFG,Top-down derivation of A, B, C;,CFG,Bottom-up parsing of A, B, C;,CFG,Left-to-right, Right-most derivation LR parsing (a shift-reduce parser),Bo

    7、ttom-up parsing of A, B, C;,CFG,Bottom-up parsing of A, B, C;,CFG,LR Parsing vs. LL Parsing,LL A top-down or predictive parser Predict needed productions based on the current left-most non-terminal in the tree and the current input token The top-of-stack contains the left-most non-terminal The stack

    8、 contains a record of what the parser expects to see LR A bottom-up or shift-reduce parser Shifts tokens onto the stack until it recognizes a right-hand side then reduces those tokens to their left-hand side The stack contains a record of what the parser has already seen,An appropriate LR Grammar,id

    9、_list id_list_prefix ; id_list_prefix id_list_prefix , id id,This grammar cant be parsed top-down! Problems for LL grammars:- left recursion, example above- common prefixes, example:stmt id := expr | id (arg_list),LL(1) Grammar for the Calculator Language,LR(1) Grammar for the Calculator Language,Hi

    10、erarchy of Linear Parsers,Basic containment relationship All CFGs can be recognized by LR parser Only a subset of all the CFGs can be recognized by LL parsers,LL parsing,CFGs LR parsing,Bigger Picture,Chomsky Hierarchy of Grammars,Regular Grammar,Context Free Grammar,Context Sensitive Grammar,Unrest

    11、ricted Grammar,Implementation of an LL Parser,Two options: A recursive descent parser (section 2.2.3) For LL grammars only Parse table and a driver (section 2.2.5) LR parsers covered in section 2.2.6,Recursive Descent Parser Example,LL(1) grammar,Recursive Descent Parser Example,Outline of recursive

    12、 parserThis parser onlyverifies syntaxmatch isthe scanner,Recursive Descent Parser Example,Recursive Descent Parser Example,Recursive Descent Parser Example,A program that develops recursive decent parsers: JavaCC,Semantic Analysis,Compiler or InterpreterTranslation Execution,Source Code,Specifying the meaningof a programming languageAttribute Grammars,Target Code,


    注意事项

    本文(Syntax Analysis(Section 2.2-2.3).ppt)为本站会员(deputyduring120)主动上传,麦多课文档分享仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文档分享(点击联系客服),我们立即给予删除!




    关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

    copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
    备案/许可证编号:苏ICP备17064731号-1 

    收起
    展开