共查询到20条相似文献,搜索用时 171 毫秒
1.
Barrett R. Bryant Balanjaninath Edupuganty Lee S. Hull 《Computer Languages, Systems and Structures》1986,11(3-4):173-191
Two-level grammars can define the syntax and the operational semantics of programming languages and these definitions are directly executable by interpretation. In this paper it is shown that axiomatic semantics can also be defined using a two-level grammar with the result being a partially automatic program verification system accomplished within the framework of a language definition. These results imply that a programming language can be defined operationally and axiomatically together in complementary definitions as advocated by Hoare and Lauer. Because two-level grammars are executable, these complementary definitions accomplish a system for interpreting and verifying programs. 相似文献
2.
Gregor V. Bochmann 《International journal of parallel programming》1979,8(6):523-539
This paper investigates some methods for proving the equivalence of different language specifications that are given in terms of attribute grammars. Different specifications of the same language may be used for different purposes, such as language definition, program verification, or language implementation. The concept of syntactic coverings is extended to the semantic part of attribute grammars. Given two attribute grammars, the paper discusses several propositions that give sufficient conditions for one attribute grammar to be semantically covered by the other one. These tools are used for a comparison of two attribute grammars that specify syntax and semantics of mixed-type expressions. This example shows a trade-off between the complexity of syntactic and semantic specifications. Another example discussed is the equivalence of different attribute grammars for the translation of the while-statement, as used in compilers for top-down and bottom-up syntax analysis.This work was in part supported by the National Research Council of Canada. 相似文献
3.
4.
Damijan Rebernak Marjan Mernik Pedro Rangel Henriques Maria Joo Varanda Pereira 《Electronic Notes in Theoretical Computer Science》2006,164(2):37
The use of object-oriented techniques and concepts, like encapsulation and inheritance, greatly improves language specifications towards better modularity, reusability and extensibility. Additional improvements can be achieved with aspect-oriented techniques since semantic aspects also crosscut many language constructs. Indeed, aspect-oriented constructs have been already added to some language specifications. The LISA compiler construction system follows an object-oriented approach and has already implemented mechanisms for inheritance, modularity and extensibility. Adding aspects to LISA will lead to more reusable language specifications. In the paper, aspect-oriented attribute grammars are introduced, and the underlying ideas are incorporated into AspectLISA, an aspect-oriented compiler generator based on attribute grammars. 相似文献
5.
6.
Jos Luis Sierra Alfredo Fernndez-Valmayor 《Electronic Notes in Theoretical Computer Science》2006,164(2):19
In this paper, we describe PAG (Prototyping with Attribute Grammars), a framework for building Prolog prototypes from specifications based on attribute grammars, which we have developed for supporting rapid prototyping activities in an introductory course on language processors. This framework works for general non-circular attribute grammars with arbitrary underlying context-free grammars, includes a specification language embedded in Prolog that strongly resembles the attribute grammar notations explained in the course cited, and lets students produce comprehensible prototypes from their specifications in a straightforward way. 相似文献
7.
《IEEE transactions on pattern analysis and machine intelligence》1981,(3):279-283
A simple portable interpreter for testing the specifications of problems is presented in this paper. These specificiations are supposed to be expressed in the formalism of attribute grammars. The parsing and the semantics evaluation are carried out simultaneously, so that the parsing can be directed by the semantics. This increases the power of the grammars and context sensitive characteristics of a language can be described. 相似文献
8.
9.
Stefano Crespi Reghizzi 《Information Processing Letters》2008,105(6):213-217
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident with Matz's context-free picture grammars). We describe a new parsing algorithm, which extends the Cocke, Kasami and Younger's classical parsing technique for string languages and preserves the polynomial time complexity. 相似文献
10.
11.
12.
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals. 相似文献
13.
Pavel Grigorenko Ando Saabas Enn Tyugu 《Electronic Notes in Theoretical Computer Science》2005,141(4):137
A compiler-compiler for visual languages is presented. It has been designed as a framework for building visual programming environments that translate schemas into textual representation as well as into programs representing the deep meaning of schemas. The deep semantics is implemented by applying attribute grammars to schema languages; attribute dependencies are implemented as methods of Java classes. Unlike compiler-compilers of textual languages, a large part of the framework is needed for support of interactive usage of a visual language. 相似文献
14.
N. P. Chapman 《Formal Aspects of Computing》1990,2(1):359-392
A new approach to describing communication protocols is introduced. In the style of a formal language, the protocol is considered as the set of all legal sequences of symbols that can be exchanged by the communicating processes. Although context free grammars cannot adequately describe such sequences, it is shown that attribute grammars may be used. Examples are given which show that common protocol features such as interleaving, windowing and flow control can be described by attribute grammars.It is shown how deadlock-proneness of a protocol can be formalised as a property of its attribute grammar specification, and the undecidability of deadlock-proneness for arbitrary grammars is proved. An algorithm is given for determining whether a protocol is deadlock-prone in the decidable case.A method of automatically implementing protocols from their specifications is described. The implementation takes the form of a pair of communicating attributed pushdown automata. These are based on LR(0) parsers, with attribute evaluation being performed in parallel with the parse; attribute values are used to help direct the parse. Consideration is also given to the handling of errors. 相似文献
15.
16.
Alexander Okhotin 《Information Processing Letters》2003,86(5):247-253
This paper demonstrates that the P-complete language of yes-instances of Circuit Value Problem under a suitable encoding can be generated by a linear conjunctive grammar, or, equivalently, accepted by a triangular trellis automaton. This result has several implications on the properties of the languages generated by conjunctive grammars of the general form and on the relationship between the abstract models of parallel computation. 相似文献
17.
18.
Erzsébet Csuhaj-Varjú 《Information Processing Letters》2010,110(20):902-5795
By showing that two nonterminals are sufficient, we present the optimal lower bound on the number of nonterminals of scattered context grammars being able to generate any recursively enumerable language. 相似文献
19.
Aravind K. Joshi 《Pattern recognition》1973,5(4):365-381
Some specific aspects of language structure are examined in detail in the context of pattern analysis. In particular, a transformational grammar is constructed for a class of patterns, following the linguistic formulation very closely, by taking a simple example and working it out in detail. Many of the characteristics of the transformational grammars of linguists show up even in this simple example. The need for looking for grammars of different styles and the problem of making meaningful assignment of probabilities to sentences in the context of transformational grammars have also been briefly discussed. 相似文献
20.
C. March C. Paulin-Mohring X. Urbain 《The Journal of Logic and Algebraic Programming》2004,58(1-2):89
We describe the basic structure of an environment for proving
programs annotated with JML specifications. Our method is generic with respect to the API, and thus well suited for
applets certification. It involves three distinct components: the
tool, which computes proof obligations for a core imperative language annotated with pre- and post-conditions, the
proof assistant for modeling the program semantics and conducting the development of proofs, and finally the
tool, a translator of our own, which reads the
files and produces specifications for
and a representation of the semantics of the
program into
’s input language. 相似文献