C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL 68 Implementation, pages 95--109, Amsterdam, 1971. North-Holland Publ. Co.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....as the general case, some kind of backtrack must be managed. ffl The grammar must be context sensitive so that the lists of expressions can be transferred from the pre analysis to the text analysis. 2 The grammatical tool StarLet StarLet [BEN89, BEN90] a tool based on Extended Affix Grammars ([KOS71, WAT74, WAT83]) has the needed properties. 3 2.1 Extended Affix Grammars Extended Affix Grammars (EAG) belong to the family of two level grammars where the rules that describe the language are endowed by parameters (here called affixes) whose types are defined by a second set of (context free) rules: the ....

C. H. A. Koster. Affix Grammars. In: J. E. L. Peck(Ed.), ALGOL 68 Implementation, pp 95-109, North-Holland Publishing Company, Amsterdam 1971.

....(poor or weak) and zero agreement of co occurring morpho syntactic and or semantic features; o an optional modifier function accounts for an interrogative, negative or conditional sentence type. 3 For relevant information about the AGFL formalism and the NLP processing environment we refer to Koster 1971 and 1992, Meijer 1986, van Halteren 1997. The AGFL documentation and software are available at: www.cs.kun.nl agfl. contextual defective forms: elliptic occurrences of both types: o one (or more) of the obligatory function realisations but possibly occurring at different and or lower levels ....

Koster, Kees. 1971. Affix Grammars, in: Peck, J (ed.): Algol 68 Implementation. Amsterdam: North-Holland. Pp. 95-105.

....i.e. the condition and the two alternatives of the if then else statement. Up to now there exists various formalizations of the concept of sd translation: ffl generalized sd translation schemes [AU73] ffl attribute grammars [Knu68] ffl denotational semantics [SS71, Gor79] ffl affix grammars [Kos71] ffl total deterministic macro tree to string transducers [CF82, Eng81, EV86] ffl context free hypergraph grammar based syntax directed translation schemes [EH89] In this paper we start from total deterministic macro tree to string transducers (for short: ymt) that are particular, left linear, ....

C.H.A. Koster. Affix grammars. In Proc. of the IFIP working conf. on ALGOL68 implementation, 1971. Amsterdam, North-Holland.

....constraints on the attributes. On the other hand, it also has the potential to completely circumvent the grammatical structure. Affix grammars Affix grammars were invented (as [Kost 91] puts it) in 1962 for use in linguistics, but not formalized until 1970. The original formal paper is [Kost 71] more recent sources are [Kost 91] and [Meij 90] Affix grammars are still another formalism that embeds the attributes into the grammar rules; they are affixed to the nonterminals, using the notation n a 1 Delta Delta Delta a i . Otherwise, the notation strongly resembles that of ....

C. H. A. Koster, "Affix grammars", in J. E. L. Peck, editor, ALGOL 68 Implementation

....and priority declarations, reuse by modularization, interfacing between the formalism and its environment, e.g. mapping to abstract syntax. Furthermore, various extensions of context free grammars are developed for attaching semantics to grammars: attribute grammars [Knu68] affix grammars [Kos71] and definite clause grammars [PW80] Examples of formalisms built on one or more of these themes are: lex [LS86] yacc [Joh75] PSG [BS86] Cigale [Voi86] synthesizer generator [RT89] Metal [Aus89] Sdf [HHKR92] txl [CC93] and pccts [PQ94] An overview of available syntax definition tools ....

C. H. A. Koster. Affix grammars. In J. E. L. Peck, editor, Algol-68 Implementation. North-Holland, Amsterdam, 1971.

....This syntax would allow the correct path means of transportation ; ftrain; bicycleg but also the incorrect path car ; tourism. In order to solve this context dependency we turn our eye to the theory of two level grammars. Examples of such grammars are attribute grammars [13] and affix grammars [14]. Since the appropriateness of selected options depends on the current focus, we need to add this information to the production rules in question. The information concerning the focus which a production rule inherits from its parents is written as a prefix to the rule, whereas the information ....

C.H.A. Koster. Affix grammars. In ALGOL 68 implementation, Proceedings of the IFIP Working Conference on ALGOL 68 Implementation 1970, pages 95--109, Amsterdam, The Netherlands, 1970. North-Holland.

....August 25, 1992 Revision 3.9 Updated edition of Arbeitsberichte der GMD Nr. 508, Februar 1 Abstract Gentle defined by F.W. Schroer [Schroer 89] is a compiler description language in the tradition of logic programming [Clocksin et al. 84] and two level grammars [Fisker et al. 75, Koster 71, Watt 74] It provides a common notation for high level description of analysis, transformation, and synthesis. A tool has been implemented to check the wellformedness of Gentle descriptions, and to generate efficient compilers. Gentle replaces a variety of special purpose languages by a general ....

C.H.A Koster. Affix grammars. In J.E.L Peck, editor, ALGOL 68 Implementation, pages 95--109. North Holland, Amsterdam, NL, 1971.

.... 1 Jurgen Vollmer June 7, 1991 GMD Research Group at the University of Karlsruhe, Vincenz Prie nitz Stra e 1, D 7500 Karlsruhe 1 email: vollmer karlsruhe.gmd.de, Phone: 49 721 6622 14 Abstract Gentle [Schroer 89] is a compiler description language in the tradition of two level grammars [Koster 71] and logic programming [Warren 80] It provides a common declarative notation for high level description of analysis, transformation, and synthesis. Imperative constructs like global variables and dynamic arrays, needed for efficient compiler construction, are introduced as well. A tool has been ....

C.H.A Koster. Affix grammars. In J.E.L Peck, editor, ALGOL 68 Implementation, pages 95--109. North Holland, 1971.

....which may require backtracking in some cases. We end this paper in Section 8 with a justification for the use of our algorithm in the AGFL project. 2 Affix grammars over a finite lattice Affix grammars over a finite lattice (AGFLs) introduced in [11] are a restricted form of affix grammars [4]. An affix grammar can be seen as a context free grammar where the productions are extended with affixes (cf. parameters, attributes, or features) to express agreement between parts of the production. The distinguishing property of AGFLs is that the domains of the affixes are given by a restricted ....

C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL68 Implementation, pages 95--109. North Holland Publishing Company, Amsterdam, 1971.

.... syntax directed translation schemes [EH92] and top down tree to graph transducers [EV94] Members of the second class are, e.g. bottom up tree transducers [Tha73, Eng75, GS84] and tree pushdown automata [SG85] Members of the third class are, e.g. attribute grammars [Knu68] affix grammars [Kos71], tree walking automata [AU71] checking tree pushdown transducers [ERS80] attributed tree transducers [Ful81] nested stack tree to string transducers [EV86] attribute coupled grammars [Gie88] higher order attribute grammars [KSV89] and macro attributed tree transducers [KV94] Many ....

C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, Proc. of the IFIP working conf. on ALGOL68 implementation, pages 95--109. North-Holland, Amsterdam, 1971.

....variables, with all their concomitant problems of unwanted access and sideeffects ffl parameters and local variables, the most explicit and best defined mechanism. In CDL, parameters and local variables can be associated with an algorithm. Due to the roots of this language in affix grammars [KOS71b] these are termed affixes. This term is also used for the (global) variables, constants and types, which we will describe in the next chapter. Each affix is denoted by a name. 1.4.1 Call with actual parameters In calling algorithms, actual parameters can be supplied. The notation alg ( PAR1 , ....

C. H. A. Koster, Affix Grammars, in: J. E. L. Peck(Ed.), ALGOL 68 Implementation, North-Holland Publishing Co., Amsterdam 1971

....Linguistics, agfl and eag, and discusses their merits. Finally, the realtionship between Affix Grammars and other two level grammars is discussed. It is not our intention to give here a rigorous description of Affix Grammars for a formal definition of Affix Grammars the reader is referred to [12]. Nor is this an easy and comprehensive introduction to the subject linguistic readers are referred to [14] and Computer Scientists to [15] or other publications cited in the bibliography. Instead, we try to provide the reader who has some experience in the use of Affix Grammars with the ....

C.H.A. Koster (1971), Affix Grammars. In: J.E.L. Peck (ed.), algol 68 Implementation, pp 95-109. North-Holland Publishing Company.

.... ideas corpus lexicon insight LDB parse trees parser GEN GWB grammar grammar ff Omega Figure 1: The interaction between GWB, GEN, and LDB. 2 Affix grammars over a finite lattice Affix grammars over a finite lattice (AGFLs) introduced in [22] are a restricted form of affix grammars ([10]) An affix grammar can be seen as a context free grammar where the productions are extended with affixes (cf. parameters, attributes, or features) to express agreement between the lhs and the rhs, and between the members in the rhs. The distinguishing property of AGFLs is that the domain of the ....

C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL68 Implementation, pages 95--109. North Holland Publishing Company, Amsterdam, 1971.

.... (Compiler Compilers, Meta compilers, Environment Generators) and on the other hand to the development of syntactic formalisms amenable to the automatic generation of software, including the various forms of two level grammars (like W Grammars [20] Attribute Grammars [10] and Affix Grammars [12]) In the work on meta compilation based on two level grammars two different directions can be distinguished [4] ffl (grammatical specification) On the one hand, some researchers [15, 9] want to allow maximum freedom in the writing of grammars and therefore in the order of evaluation of the ....

C. H. A. Koster, Affix Grammars, In: J. E. L. Peck(Ed.), ALGOL 68 Implementation, North-Holland Publishing Co., Amsterdam 1971.

....language with a detailed and complicated morphosyntax. First the concepts and notation of agfls are briefly described, followed by a sketch of a description of the turkish finite verb, including vowel and consonant harmony and the backward effects of suffixes. 1 Introduction Affix Grammars [1] are a formalization of a notion well known to linguists (see e.g. 2] Context Free grammars augmented with features for expressing agreement between parts of speech. Such grammars have been used extensively in classical Linguistics (albeit in a non formal form) for more than two thousand years. ....

C.H.A. KOSTER, Affix Grammars. In: J.E.L. Peck (ed.), algol 68 Implementation, North-Holland Publishing Company, Amsterdam, 1971.

....have had as effect that the research based on them has been characterized by different concerns, but most theoretical results achieved with respect to one of them can also be applied to the other. Affix Grammars were invented (for linguistic applications) in 1962 [19] and were formalized in 1970 [14]. They form a family of two level grammars ( affixes domains CF grammar operations ) where the first or lower level consists of CF rule schemata, CF rules extended with metavariables (affixes) and the second level defines the domains of these affixes. Included among the nonterminals of ....

....FI ] We will not attempt to define identifier in the same formalism, the gist of the example should be clear by now. We have to rely on a rather large number of predicates defined outside the formalism. This open endedness is a mixed blessing. It is also present in the original definition of AG [14] but need not be exploited in EAG. The separation of the CF rules from their attribuation rules makes it hard to follow the fate of a particular attribute. The passing around of attributes takes a rather large amount of writing (which may be reduced through suitable default conventions) In the ....

C.H.A. Koster, Affix Grammars. In: J.E.L. Peck (ed.), algol 68 Implementation, 95-109. North-Holland Publishing Company, Amsterdam, 1971.

No context found.

C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL 68 Implementation, pages 95--109, Amsterdam, 1971. North-Holland Publ. Co.

No context found.

C.H.A. Koster. Affix grammars. In J.E.L. Peck, editor, ALGOL 68 Implementation, pages 95--109, Amsterdam, 1971. North-Holland Publ. Co.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC