4,492 Hits in 4.5 sec

Parallel communicating grammar systems with bounded resources

Erzsébet Csuhaj-Varjú, György Vaszil
2002 Theoretical Computer Science  
In this paper we study size properties of context-free returning parallel communicating grammar systems (PC grammar systems).  ...  We show that for each context-free returning PC grammar system an equivalent system of this type can be constructed, where the total number of symbols used for describing a component can be bounded by  ...  For each context-free returning PC grammar system we can construct an equivalent context-free returning PC grammar system such that CProd( )67. Proof.  ... 
doi:10.1016/s0304-3975(01)00172-4 fatcat:thyzvycgabgfrp2bks6f76cwse

Parallel Communicating Grammar Systems [chapter]

Lila Santean
1993 Current Trends in Theoretical Computer Science  
Each of the grammars rewrites the sentential form until a certain condition is met. Then it passes it to the next grammar, and so on, until a terminal string is obtained.  ...  Cooperating /distributed grammar systems are an attempt of modelling the process of communication [2] . They consist of a system of grammars working together to produce words of a language.  ...  Depending on the context, REG, LIN , CF , CS , RE denote the classes of λ-free regular, λ-free linear, λ-free context-free, context-sensitive, recursively enumerable grammars, or the family of languages  ... 
doi:10.1142/9789812794499_0047 dblp:series/wsscs/Santean93 fatcat:fqcna5yxg5emzm7sqfityku7pq

On the Size Complexity of Non-Returning Context-Free PC Grammar Systems

Erzsébet Csuhaj-Varjú, György Vaszil
2009 Electronic Proceedings in Theoretical Computer Science  
Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components  ...  We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the number of nonterminals  ...  To prove the statement, we construct a non-returning context-free PC grammar system Γ gener- ating L.  ... 
doi:10.4204/eptcs.3.8 fatcat:hxtnior725crrpr6gjdhc6xyk4

On simulating non-returning PC grammar systems with returning systems

György Vaszil
1998 Theoretical Computer Science  
Non-returning PC grammar systems with n context free components are simulated in [3] by returning PC grammar systems with 4n2 -3n + 1 components.  ...  In this paper we reduce the number of components of the simulating system by using a different simulating construction.  ...  In the following, we present a simulation of non-returning context-free PC grammar systems with returning systems using a method different from [3] .  ... 
doi:10.1016/s0304-3975(97)00120-5 fatcat:fyvj2x3aofdgpgc6ps2ydclkly

On the computational power of context-free PC grammar systems

Niculae Mandache
2000 Theoretical Computer Science  
Since it was proven that such systems can be simulated by returning PC grammar systems with context-free components, the result extends to those.  ...  It is shown that non-returning parallel communicating grammar systems with -free contextfree components can generate any recursively enumerable language.  ...  As mentioned earlier, in [6] it is proven that returning PC grammar systems with context-free components can simulate the working of non-returning ones (in returning PC grammar systems, a component returns  ... 
doi:10.1016/s0304-3975(98)00159-5 fatcat:czxsxipgljeoxjoay6nsmow42a

Optimizing Parser Combinators

Jan Kurš, Jan Vraný, Mohammad Ghafari, Mircea Lungu, Oscar Nierstrasz
2016 Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies - IWST'16  
Parser combinators follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones.  ...  In this work we present a more traditional approach to optimization -a compiler -applied to the domain of parser combinators.  ...  Implementation of Combinators In this section we provide an implementation of all the combinators mentioned in this work to help the reader better understand the overhead of a combinator library.  ... 
doi:10.1145/2991041.2991042 fatcat:tdgyvsvmpnd7tgv2mhwbkin74a

Processor modeling for hardware software codesign

V. Rajesh, R. Moona
1999 Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013)  
We envisage the use of the generated simulator for cycle based analysis of the processor and for performance estimation of the system. This work is primarily an extension of nML[2] language.  ...  As a part of this work, we implemented an instruction set simulator generator which takes Sim-nML description of the processor as input and produces C++ code for performance simulator.  ...  data=extract_bits(image,8,16); } }; An attribute grammar is a context free grammar in which for each nonterminal a fixed set of attributes and for each production a set of semantic rule is given  ... 
doi:10.1109/icvd.1999.745137 dblp:conf/vlsid/RajeshM99 fatcat:siop6p3u6fhqtnqfdis2z4slgu

A survey of adaptable grammars

H. Christiansen
1990 SIGPLAN notices  
An ECF consists of a context-free grammar and an associated !nite state machine. The !  ...  The offending token matches the context-free part of a grammar rule and the error is exposed by the context constraint.  ...  New rules are generated for applying the declared operatorC for accessing formal parameters inside the function bodyC and for function exit. declaration(dfn-call) in dcontext ffunctiongC formal(dpar C  ... 
doi:10.1145/101356.101357 fatcat:q2lzrk3wrbb4jlw6s6nepn27re

Adding semantic and syntactic predicates to LL(k): pred-LL(k) [chapter]

Terence J. Parr, Russell W. Quong
1994 Lecture Notes in Computer Science  
Semantic predicates indicate the semantic validity of applying a production; syntactic predicates are grammar fragments that describe a syntactic context that must be satisfied before application of an  ...  Throughout, we discuss the implementation of predicates in ANTLR--the parser generator of The Purdue Compiler-Construction Tool Set.  ...  Acknowledgements We would like to thank Ariel Tamches, Dana Hoggatt, Ed Harfmann, and Hank Dietz, who all helped shape the definition of semantic predicates.  ... 
doi:10.1007/3-540-57877-3_18 fatcat:7ktmzykm3fgozhu3s6no5d45ru

A systematic approach to the implementation of attribute grammars with conventional compiler construction tools

Daniel Rodríguez-Cerezo, Antonio Sarasa-Cabezuelo, José-Luis Sierra
2012 Computer Science and Information Systems  
The pattern makes possible the direct implementation of attribute grammar-based specifications with widely-used translation schemedriven tools for the development of both bottom-up (e.g.  ...  Since these implementations still preserve the ability to be extended with new features described at the attribute grammar level, the advantages from the point of view of development and maintenance become  ...  Also, Daniel Rodriguez-Cerezo was supported by the Spanish University Teacher Training Program (EDU/3445/2011).  ... 
doi:10.2298/csis111223022r fatcat:32xttlaltzazpaa4xtyqpj6bje

Active Learning of Input Grammars [article]

Matthias Höschele, Alexander Kampmann, Andreas Zeller
2017 arXiv   pre-print
As a result, we need only a minimal set of sample inputs to obtain human-readable context-free grammars that reflect valid input structure.  ...  ; (2) assign these entities names that are based on the associated variable and function identifiers; and (3) systematically generalize production rules by means of membership queries.  ...  Deriving Grammars After clustering the nodes of all interval trees as described in Section III-D the clusters can be used by our heuristics to derive a context-free grammar with non-terminal symbols and  ... 
arXiv:1708.08731v1 fatcat:gaxqc5gdwbcdvb5uztbpsje3ay

A large neighbourhood search approach to the multi-activity shift scheduling problem

Claude-Guy Quimper, Louis-Martin Rousseau
2009 Journal of Heuristics  
In this paper, we show how formal languages (such as regular and context-free languages) can be enhanced and used to model the complex regulations of the shift construction problem.  ...  These approaches are able to return near optimal solution on traditional single activity problems and they scale well on large instances containing up to 10 activities.  ...  A context-free grammar is a tuple G = N, S, Σ, P where N is a set of symbols called the non-terminals, S ∈ N is the starting non-terminal, Σ is a set of symbols called the terminals, and P is a set of  ... 
doi:10.1007/s10732-009-9106-6 fatcat:aouxyjlgb5f4fno45wyns2tkve

A grammar-based unification of several alignment and folding algorithms

F Lefebvre
1996 Proceedings. International Conference on Intelligent Systems for Molecular Biology  
We also show that MTSAG's offer a new, efficient and useful way to handle stochastic context-free grammars and tools that generate them.  ...  This formalism relieves the designer of biological models of implementation details which may hinder his inventiveness.  ...  Grate for data on UCSC's SCFG experiments and F. Corpet for providing me with the source of the RNAlign tool. Lefebvre  ... 
pmid:8877514 fatcat:yiq457ouhnhuvggcmcwx7wkai4

Context-Driven Constraint Multiset Grammars with Incremental Parsing for On-line Structured Document Interpretation

Sebastian Mace
2007 Proceedings of the International Conference on Document Analysis and Recognition  
We introduce Context-Driven Constraint Multiset Grammars (CDCMG) to model the analysis of strokes drawn in the context of document composition; they allow visual arrangement, constraint and stroke recognition  ...  system handling by coupling a global vision of the document with a local vision of the analyzed elements.  ...  This project benefits from the financial support of the Brittany Region.  ... 
doi:10.1109/icdar.2007.4378748 dblp:conf/icdar/Mace07 fatcat:rlzqxfwx2fbs5la3g7k545yyny

Parsing Turkish with the Lexical Functional Grammar Formalism [article]

Zelal Gungordu and Kemal Oflazer
1994 arXiv   pre-print
The grammar covers a substantial subset of Turkish including simple and complex sentences, and deals with a reasonable amount of word order freeness.  ...  After a discussion of key relevant issues regarding Turkish grammar, we discuss aspects of our system and present results from our implementation.  ...  We would also like to thank Elisabet Engdahl and Matt Crocker of the Centre for Cognitive Science, University of Edinburgh, for providing valuable comments and suggestions.  ... 
arXiv:cmp-lg/9406008v1 fatcat:fwt64nlcq5emvghyeqa2lrmtfq
« Previous Showing results 1 — 15 out of 4,492 results