检索结果-内蒙古大学图书馆

FUNCTION ITERATION LOGICS AND FLOWCHART SCHEMATA

COMPUTING 1975年第3期14卷 285-312页

作者： CHERNIAVSKY, J SUNY DEPT COMP SCI STONY BROOK NY 11790 USA

An interpreted two-sorted logic is defined to allow the representation of a subclass of flowchart schemata. A decision procedure for the equivalence of simple representing formulae within the logic is developed and as a consequence a decision procedure for flowchart schemata within the subclass is demonstrated. Applications of the techniques developed within the paper result in further decision procedures for the equivalence of flowchart schemata in other subclasses. In addition, a decision procedure for the equivalence of programs in a simple programming language is given.

关键词： Computational Mathematic programming Language Decision Procedure Function Iteration simple programming

来源：评论

学校读者我要写书评

暂无评论

Semantics of context-free languages

引用

Mathematical Systems Theory 1968年第2期2.0卷 127-145页

作者： Knuth, Donald E. California Institute of Technology United States

"Meaning" may be assigned to a string in a context-free language by defining "attributes" of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of this process when some of the attributes are "synthesized", i.e., defined solely in terms of attributes of the descendants of the corresponding nonterminal symbol, while other attributes are "inherited", i.e., defined in terms of attributes of the ancestors of the nonterminal symbol. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal specification of semantics which have appeared in the literature. © 1968 Springer-Verlag New York Inc.

关键词： Computational Mathematic programming Language Formal Specification Derivation Tree simple programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：