Filters








10,414 Hits in 8.3 sec

Page 2175 of Mathematical Reviews Vol. , Issue 82e [page]

1982 Mathematical Reviews  
Wegner, Lutz 82e:68088 Bracketed two-level grammarsa decidable and practical approach to language definitions.  ...  For specialists both in attribute grammars and in van Wijngaarden (two-level) grammars this is a very fine paper.  ... 

How to Embed Noncrossing Trees in Universal Dependencies Treebanks in a Low-Complexity Regular Language

Anssi Mikael Yli-Jyrä
2019 Journal of Language Modelling  
A recently proposed balanced-bracket encoding (Yli-Jyrä and Gómez-Rodríguez 2017) has given us a way to embed all noncrossing dependency graphs into the string space and to formulate their exact arcfactored  ...  When bounded to 7 levels of balanced brackets, the automaton has 762 states and represents a strict superset of more than 99.9999% of the noncrossing trees available in Universal Dependencies 2.4 (Nivre  ...  Decidability: These grammars are unambiguous and can be related to a rich calculus of tree automata.  ... 
doi:10.15398/jlm.v7i2.213 fatcat:ki3hfms22jcl5o5p7czh2leozi

Pure and declarative syntax definition

Lennart C.L. Kats, Eelco Visser, Guido Wachsmuth
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
Syntax definitions are pervasive in modern software systems, and serve as the basis for language processing tools like parsers and compilers.  ...  We analyze how these problems arise for different aspects of syntax definitions, discuss their consequences for language engineers, and show how the pure and declarative nature of syntax definitions can  ...  Acknowledgements We thank Glenn Vanderburg and the anonymous referees for providing valuable feedback to improve the presentation of this paper.  ... 
doi:10.1145/1869459.1869535 dblp:conf/oopsla/KatsVW10 fatcat:7aw33mllmjakpgf3bjgopblwty

Natural and Flexible Error Recovery for Generated Modular Language Environments

Maartje de Jonge, Lennart C. L. Kats, Eelco Visser, Emma Söderberg
2012 ACM Transactions on Programming Languages and Systems  
Our approach is language-independent, and relies on automatic derivation of recovery rules from grammars.  ...  We implemented our approach based on the modular syntax definition formalism SDF [Heering et al. 1989; Visser 1997c] and JSGLR 2 , a Java-based implementation of the SGLR parsing algorithm.  ...  Natural and Flexible Error Recovery for Generated Modular Language Environments Acknowledgments.  ... 
doi:10.1145/2400676.2400678 fatcat:t6ur76u545bj7aei37w2lzo6qm

Algorithmic Programming Language Identification [article]

David Klein, Kyle Murray, Simon Weber
2011 arXiv   pre-print
Our work is based on supervised learning and intelligent statistical features. We also explored, but abandoned, a grammatical approach.  ...  Motivated by the amount of code that goes unidentified on the web, we introduce a practical method for algorithmically identifying the programming language of source code.  ...  This allows a linear time parser for all PEGs. Two main problems had to be addressed for our high-level approach to work.  ... 
arXiv:1106.4064v2 fatcat:6rszqb3igrfaxgjucnwtyx3fdi

On Dependency Analysis via Contractions and Weighted FSTs [chapter]

Anssi Yli-Jyrä
2012 Shall We Play the Festschrift Game?  
Arc contractions in syntactic dependency graphs can be used to decide which graphs are trees.  ...  The algorithm is customizable to functional and bilexical dependency parsing, and it can be extended to non-projective parsing via a multi-planar encoding with prior results on high recall.  ...  Acknowledgements The research has been made possible by the Academy of Finland grant number 128536 "Open and Language Independent Automata-Based Resource Production Methods for Common Language Research  ... 
doi:10.1007/978-3-642-30773-7_10 dblp:conf/birthday/Yli-Jyra12 fatcat:kkrof4kqsvaevhfj26qgr5pxti

Analyzing ambiguity of context-free grammars

Claus Brabrand, Robert Giegerich, Anders Møller
2010 Science of Computer Programming  
It may seem surprising that the static analysis of this program property can be approached as a question of language ambiguity on the formal language level.  ...  Before we start presenting our method, we state two requirements on a practical ambiguity checker that result from the biosequence analysis domain and must be kept in mind in the sequel: First, the grammars  ...  Regular Approximation One approach for obtaining decidability is to consider regular approximations, that is, ones where A G (α) is a regular language for each α: the family of regular languages is closed  ... 
doi:10.1016/j.scico.2009.11.002 fatcat:polivdbggrg7dndks7mmxe5ndy

Tree-affix dendrogrammars for languages and compilers [chapter]

Frank DeRemer, Richard Jullig
1980 Lecture Notes in Computer Science  
The grammars are proposed for language specifications in reference manuals and for the automatic generation of practical compiler modules.  ...  Research in progress is reported regarding a variation on attribute and affix grammars intended for describing the "static semantic" or "context-sensitive syntactic" constraints on programming languages  ...  In 1979 Watt and Madsen combined some of the best ideas from attribute, affix, and two-level [Van 75] grammars to form a very civil "extended attribute grammar" (EAG) [W&M 79] .  ... 
doi:10.1007/3-540-10250-7_26 fatcat:qbjxzlw6gnf7vpal3cezorznqu

CENTAURUS: A Dynamic Parser Generator for Parallel Ad Hoc Data Extraction

Shigeyuki Sato, Hiroka Ihara, Kenjiro Taura
2020 Journal of Information Processing  
A stage-1 parser generates the chunks of the bracket * 5 https://asmjit.com/ Fig. 9 Type definitions of brackets and reduced brackets, where n denotes nonterminal, p denotes position on input, and v ∈  ...  In terms of programmability, thanks to their regular lookahead of input, LL(*) grammars naturally subsume regular expressions with lookahead, which is a practical extension supported by many languages  ... 
doi:10.2197/ipsjjip.28.724 fatcat:q3sxolcbcradhhfdsd5ocj2pfu

smgn: Rapid Prototyping of Small Domain-Specific Languages

Holger M. Kienle, David L. Moore
2002 Journal of Computing and Information Technology  
The parse tree can be easily navigated and manipulated with a specific macro language while conveniently generating textual output. smgn is easy to learn-even for non-compiler experts-and well suited for  ...  This paper presents smgn, a grammar-based tool that provides support for scanning, parsing, and automatic parse tree construction.  ...  In practice, it is beneficial to try to develop a grammar that is close to LL(1).  ... 
doi:10.2498/cit.2002.01.03 fatcat:3a7p5k4nxjbd5ciesqop4ql3mm

Analyzing Ambiguity of Context-Free Grammars

Claus Brabrand, Robert Giegerich, Anders Møller
2006 BRICS Report Series  
Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures.  ...  As an application, we consider grammars that occur in RNA analysis in bioinformatics, and we demonstrate that our static analysis of context-free grammars is sufficiently precise and efficient to be practically  ...  Regular Approximation One approach for obtaining decidability is to consider regular approximations, that is, ones where A G (α) is a regular language for each α: the family of regular languages is closed  ... 
doi:10.7146/brics.v13i9.21965 fatcat:5yeara6i6ncvlpmfd3invchyui

Analyzing Ambiguity of Context-Free Grammars

Claus Brabrand, Robert Giegerich, Anders Møller
2007 BRICS Report Series  
Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures.  ...  As an application, we consider grammars that occur in RNA analysis in bioinformatics, and we demonstrate that our static analysis of context-free grammars is sufficiently precise and efficient to be practically  ...  Regular Approximation One approach for obtaining decidability is to consider regular approximations, that is, ones where A G (α) is a regular language for each α: the family of regular languages is closed  ... 
doi:10.7146/brics.v14i10.21932 fatcat:gwvdpubylrcflfwnxdiuoalmu4

MediaWiki Grammar Recovery [article]

Vadim Zaytsev
2011 arXiv   pre-print
Over two hundred grammar transformation steps are reported and annotated, leading to delivery of a level 2 grammar, semi-automatically extracted from a community created semi-formal text using at least  ...  Having a quality grammar will allow to test and validate it further, without alienating the community with a separately developed grammar.  ...  It is a field that emerged in recent years, generalising theoretical and practical aspects of programming languages, markup languages, modelling languages, data definition languages, transformation languages  ... 
arXiv:1107.4661v1 fatcat:k5gugvhd7zhpdnxztij6mbpvga

Error-driven pruning of Treebank grammars for base noun phrase identification

Claire Cardie, David Pierce
1998 Proceedings of the 36th annual meeting on Association for Computational Linguistics -  
The training phase of the algorithm is based on two successful techniques: first the base NP grammar is read from a "treebank" corpus; then the grammar is improved by selecting rules with high "benefit  ...  In particular, we present a corpus-based approach for finding base NPs by matching part-ofspeech tag sequences.  ...  This work was supported in part by NSF Grants IRI-9624639 and GER-9454149. We thank Mitre for providing their part-of-speech tagger.  ... 
doi:10.3115/980845.980881 dblp:conf/acl/CardieP98 fatcat:byti2jl72ba2dpvwgjtozo6izu

Bracketing and aligning words and constituents in parallel text using Stochastic Inversion Transduction Grammars [chapter]

Dekai Wu
2000 Text, Speech and Language Technology  
We introduce (1) a novel stochastic inversion transduction grammar formalism for bilingual language modeling of sentence-pairs, and (2) the concept of bilingual parsing with a variety of parallel corpus  ...  We discuss a number of examples of how stochastic inversion transduction grammars bring bilingual constraints to bear upon problematic corpus analysis tasks such as segmentation, bracketing, phrasal alignment  ...  We have found this to be useful in practice. For bracketing grammars of the type considered in this paper, there is no advantage.  ... 
doi:10.1007/978-94-017-2535-4_7 fatcat:3vhelti7pfaw5pkv6md5zjgdrm
« Previous Showing results 1 — 15 out of 10,414 results