Filters








80,266 Hits in 3.7 sec

Yacc is dead [article]

Matthew Might, David Darais
2010 arXiv   pre-print
We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski's derivative from regular expressions to context-free grammars.  ...  Preliminary experiments with S-Expressions parsed millions of tokens per second, which suggests this technique is efficient enough for use in practice.  ...  There is a class for parsing an individual token (T), a class for the null string (ǫ), and a class for the empty language (∅): class T[T] (t : T) extends Parser[T,T] class ǫ[T,A] (g : => Stream[A]) extends  ... 
arXiv:1010.5023v1 fatcat:lznh3iovyba4nmgjhyottxmv7q

Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing [chapter]

Jean-Cédric Chappelier, Martin Rajman
2000 Lecture Notes in Computer Science  
, and (2) to show how such sampling techniques can be efficiently implemented with an explicit control of the error probability.  ...  The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in the framework of weighted parsing  ...  Some NP-Hard Maximization Problems in the Framework of Weighted Parsing When only one single class of derivation is considered (for instance the parsing of a unique input sentence with a SCFG), weighted  ... 
doi:10.1007/3-540-45154-4_10 fatcat:f224t6jmb5cjbcaskxern6dci4

Representation Learning and Dynamic Programming for Arc-Hybrid Parsing

Joseph Le Roux, Antoine Rozenknop, Mathieu Lacroix
2019 Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL)  
From this representation we are able to derive an efficient parsing algorithm and design a neural network that learns vertex representations and arc scores.  ...  We present a new method for transition-based parsing where a solution is a pair made of a dependency tree and a derivation graph describing the construction of the former.  ...  In this paper we first explicitly consider that a solution in transition-based parsing is represented as a pair made of a derivation graph and a derived dependency tree allowing the scoring function to  ... 
doi:10.18653/v1/k19-1023 dblp:conf/conll/RouxRL19 fatcat:bhv7c2ouojfejoif377gcb25ci

LLparse and LRparse

Stephen A. Blythe, Michael C. James, Susan H. Rodger
1994 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education - SIGCSE '94  
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing.  ...  (1) parsing table.  ...  There are four steps in computing an LR(1) parse table. As with LL(1) parsing, the first two steps are computing FIRST and FOLLOW sets.  ... 
doi:10.1145/191029.191121 dblp:conf/sigcse/BlytheJR94 fatcat:jqisjnkozrcwbnmvvn2djkgw5y

Type-Driven Automatic Quotation of Concrete Object Code in Meta Programs [chapter]

J. J. Vinju
2006 Lecture Notes in Computer Science  
The first solution is to filter out cyclic derivations from the parse forest.  ...  The first two classes require no type analysis, while the last two classes will be filtered by type checking. Class 3.1.  ... 
doi:10.1007/11751113_8 fatcat:mm6dgd6aprbobnbeqg7bl45rwi

LLparse and LRparse

Stephen A. Blythe, Michael C. James, Susan H. Rodger
1994 ACM SIGCSE Bulletin  
This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting with small examples of LL and LR parsing.  ...  (1) parsing table.  ...  There are four steps in computing an LR(1) parse table. As with LL(1) parsing, the first two steps are computing FIRST and FOLLOW sets.  ... 
doi:10.1145/191033.191121 fatcat:6l7hgm7gefaw3n3vyrfw7z4htm

Data Language Specification via Terminal Attribution [article]

Alexander Sakharov, Timothy Sakharov
2015 arXiv   pre-print
We introduce a notation in which grammars are defined by simply dividing terminals into predefined classes and then splitting elements of some classes into multiple layered sub-groups.  ...  Unstructured data have to be parsed in order to become usable. The complexity of grammar notations and the difficulty of grammar debugging limit the use of parsers for data preprocessing.  ...  Let us prove the 'only if' part first. The proof of the first condition is done by induction on the number of parse tree nodes labeled by production B → F SH in the derivation of a given string.  ... 
arXiv:1511.00909v1 fatcat:drvrwhp6wfb5bbjs7gnxe7kw6a

Simple chain grammars [chapter]

Anton Nijholt
1977 Lecture Notes in Computer Science  
A very simple (bottom-up) parsing method is provided.  ...  Although there exist simple chain g r~a r s which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars.  ...  Assl~me for all ~ £ V+~ and derivations ~ ~wl, and less than n and m respectively, we have w 2 = e. Now consider derivations ~ ~>w I and ~ =~=>wlw2, with lengths n and m respectively.  ... 
doi:10.1007/3-540-08342-1_27 fatcat:dyapxylnkjh6fjwewlbxctn2wa

Parsing with C++ deferred expressions

Damian Conway
1994 SIGPLAN notices  
This paper presents an extension to that technique which allows parsing actions to be specified directly as part of the grammar, rather than indirectly (as function calls).  ...  This expression object belongs to a class derived from the root Parser class, and hence the original expressions used to generate it may be incorporated seamlessly into any embedded grammar built with  ...  The first additional class required is ParserOstream, which is used to encapsulate ostream objects 1 using a private reference. Note that ParserOstream need not be derived from ParserExpr.  ... 
doi:10.1145/185009.185011 fatcat:hozbrgdfwrfvvjh6tul4si3aiq

Parse Forest Diagnostics with Dr. Ambiguity [chapter]

Hendrikus J. S. Basten, Jurgen J. Vinju
2012 Lecture Notes in Computer Science  
We first analyze the diversity of ambiguities in grammars for programming languages and the diversity of solutions to these ambiguities. Then we introduce DR.  ...  We demonstrate its effectiveness using a small experiment with a grammar for Java 5. 1 Linear behavior is usually approached and most algorithms can obtain cubic time worst time complexity [33] Ambihuous  ...  Note that a single parse tree may represent several equivalent derivation sequences. Namely in sentential forms with several non-terminals one may always choose which non-terminal to expand first.  ... 
doi:10.1007/978-3-642-28830-2_16 fatcat:m5hzy5amljgdfktgtkma7tyrgq

Simplified Parsing Expression Derivatives [chapter]

Aaron Moss
2020 Lecture Notes in Computer Science  
This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented  ...  Introduction A derivative parsing algorithm for parsing expression grammars (PEGs) was first published by Moss [12] ; this paper presents a simplified and improved algorithm, as well as a practical comparison  ...  Derivative parsing presents a different trade-off, with low common-case memory usage paired with a polynomial time bound.  ... 
doi:10.1007/978-3-030-40608-0_30 fatcat:kao6hlfa2baitflsbyxwie4ukm

Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States

Ashish Vaswani, Kenji Sagae
2016 Transactions of the Association for Computational Linguistics  
This is accomplished with the introduction of error states in local training, which add information about incorrect derivation paths typically left out completely in locally-trained models.  ...  Using neural networks for our local classifiers, our approach achieves 93.61% accuracy for transition-based dependency parsing in English.  ...  In addition to associating features from state 3 with shift, we associate features from state 4 with the error class, and features from state 5 with the error class.  ... 
doi:10.1162/tacl_a_00092 fatcat:j6v6gxsyx5eyxmvpcb4xqcweha

The hierarchy of LR-attributed grammars [chapter]

Rieks Akker, Bořivoj Melichar, Jorma Tarhio
1990 Lecture Notes in Computer Science  
The problem of attribute evaluation during LR parsing is considered. Several definitions of LR-attributed grammars are presented. Relations of corresponding attribute grammar classes are analysed.  ...  Also the relations between LR-attributed grammars and LL-attributed grammars and between LR-attributed grammars and a class of one-pass attributed grammars based on left-corner grammars are considered.  ...  For example, LL parsing allows a full top-down evaluation traversal (a depth-first, left-to-right walk through a derivation tree), but LR parsing allows only a bottom-up traversal, in which every node  ... 
doi:10.1007/3-540-53101-7_2 fatcat:c5q7tt2mrrcrpitdnixmckuv2y

Formal Grammars and Languages [chapter]

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth Regan
1998 Algorithms and Theory of Computation Handbook  
It turns out that in bottom-up parsing rightmost derivations are easier to deal with than leftmost derivations.  ...  Rightmost derivations are likewise in 1-1 correspondence with derivation trees.  ...  The parser first pops the top 2k symbols q m , X m , . . . , q m−k+1 , X m−k+1 off the stack.  ... 
doi:10.1201/9781420049503-c26 fatcat:x3mj3ftb5rhf3nih23b7dr4l54

Formal Grammars and Languages [chapter]

Tao Jiang, Ming Li, Bala Ravikumar, Kenneth Regan
2009 Algorithms and Theory of Computation Handbook, Second Edition, Volume 1  
It turns out that in bottom-up parsing rightmost derivations are easier to deal with than leftmost derivations.  ...  Rightmost derivations are likewise in 1-1 correspondence with derivation trees.  ...  The parser first pops the top 2k symbols q m , X m , . . . , q m−k+1 , X m−k+1 off the stack.  ... 
doi:10.1201/9781584888239-c20 fatcat:k4e5ivi7ujgpbkb47nectsjwxi
« Previous Showing results 1 — 15 out of 80,266 results