Elkhound A Fast, Practical GLR Parser Generator猎鹿犬快速、实用的GLR分析器生成器.pptVIP

下载本文档

2
0
约4.99千字
约 22页
2017-02-13 发布于上海
举报
版权申诉

Elkhound A Fast, Practical GLR Parser Generator猎鹿犬快速、实用的GLR分析器生成器.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文档。上传文档

Elkhound: A Fast, PracticalGLR Parser Generator Scott McPeaksmcpeak@9/16/02 OSQ Lunch So what’s wrong with Bison? LALR(1) is the problem Restrictive subset of context-free grammars Grammar hacking breaks conceptual structure Can’t resolve conflicts automatically if actions are present LR is not closed under composition (union) Fixing LR conflicts is hard: time, expertise Ambiguous Grammars Use of ambiguity can simplify grammar e.g. “E ! E + E”, plus a rule for associativity Ambiguity can delay hard choices Type/variable name ambiguity in C: “(a) (b)” C++: constructors, function-style casts, etc. Other hard languages: Javascript, Perl Natural languages? Generalized LR (GLR) Developed in 80’s; natural language parsing Conceptually simple Uses any context-free grammar Ambiguous grammars ! parse forest Efficient: same as LR in best case Worst case: O(2n) Earley (1970) best is Q(n2), worst is O(n3) Review: LR Parsing “L”: left-to-right parsing of input “R”: build rightmost derivation (in reverse) Build parse tables ahead of time On each token, either shift it, pushing it onto the parse stack, or reduce symbols at top of stack, via some production Example: Arithmetic Example LR Parse GLR: Graph-structured stack Idea: pursue all possible parses at once Allow stack to be forked into multiple “parsers” Alternate between shifts and reduces If two parsers enter same state, merge them GLR: Graph-structured stack Idea: pursue all possible parses at once Allow stack to be forked into multiple “parsers” Alternate between shifts and reduces If two parsers enter same state, merge them Example GLR Parse Aside: Nondeterminism GLR extends LR by making the stack nondeterministic Other examples: DFA NFA finite control LL LR finite control LR GLR pushdown stack Optimization: Hybrid LR/GLR Full GLR is slower than LR due to the cost of interpreting the GSS But grammars are likely to be mostly deterministic (mostly linear stack) Question: How to recognize when deterministic