计算机语法和编程英文版.pptVIP

下载本文档

2
0
约3.25千字
约 20页
2017-09-12 发布于河南
举报
版权申诉

计算机语法和编程英文版.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

计算机语法和编程英文版

L4CFG cs466(Prasad) L4CFG * Context-free Grammars cs466(Prasad) L4CFG * Recursive definition Grammar Derivation cs466(Prasad) L4CFG * What is the syntax of the description (meta-language)? External form of the grammar How do we associate a language with such a description? Semantics or use of the grammar Generators: Grammars specify languages by generating strings in the language. Recognizers: Grammars can be viewed as a notation for describing a family of recognition algorithms. cs466(Prasad) L4CFG * CFG = (V, ,P,S) V : Finite set of variables/non-terminals : Alphabet/Finite set of terminals P : Finite set of rules/productions S : Start symbol cs466(Prasad) L4CFG * a* represents a context-free language because we can write a CFG for it. A-rule, null-rule, -rule. Context-freeness: An A-rule can be applied whenever A occurs in a string, irrespective of the context (that is, non-terminals and terminals around A). Cf. context-sensitive grammar (“declare-use”) cs466(Prasad) L4CFG * One-step Derivation (Defn: 3.1.2) w is derivable from v in CFG, if there is a finite sequence of rule applications such that: From CFG to Language cs466(Prasad) L4CFG * Let G=(V, S, P, S) be a CFG. is a sentential form, if . is a sentence, if . The language of G, L(G) = cs466(Prasad) L4CFG * Derivation of aabb Derivation tree S a b S a b l cs466(Prasad) L4CFG * cs466(Prasad) L4CFG * Derivation Tree (abstracts derivation) S A B a A B b l l cs466(Prasad) L4CFG * Examples: CFGs and CFLs cs466(Prasad) L4CFG * cs466(Prasad) L4CFG * Note that parentheses are part of the meta-language. cs466(Prasad) L4CFG * cs466(Prasad) L4CFG * cs466(Prasad) L4CFG * Left to right generation of string. cs466(Prasad) L4CFG * A regular grammar is a CFG in which each of the rules has the form: (Right Linear Grammar) Regular Grammar cs466(Prasad) L4CFG * A r