首页> 外文会议>Asian symposium on programming languages and systems >A Computational Interpretation of Context-Free Expressions
【24h】

A Computational Interpretation of Context-Free Expressions

机译:上下文无关表达式的计算解释

获取原文

摘要

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression.
机译:我们将使用上下文无关的表达式进行短语分析称为类型居住问题,其中值是解析树,而类型是上下文无关的表达式。我们首先展示如何通过使用状态的规范表示将上下文无关和正则表达式之间的包含减少为可及性问题。程序证明的原理以强制性的形式给出了可达性问题的计算解释,该强制性将无上下文表达式的分析树转换为正则表达式的分析树。从常规解析树到无上下文的树,它也会产生部分强制。从所有单词的琐碎语言到上下文无关表达式的部分强制相当于该表达式的预测解析器。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号