The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

## Filters

##
###
Yacc is dead
[article]

2010
*
arXiv
*
pre-print

We present two novel approaches to

arXiv:1010.5023v1
fatcat:lznh3iovyba4nmgjhyottxmv7q
*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 ...##
###
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
[chapter]

2000
*
Lecture Notes in Computer Science
*

, and (2) to show how such sampling techniques can be efficiently implemented

doi:10.1007/3-540-45154-4_10
fatcat:f224t6jmb5cjbcaskxern6dci4
*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 ...##
###
Representation Learning and Dynamic Programming for Arc-Hybrid Parsing

2019
*
Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL)
*

From this representation we are able to

doi:10.18653/v1/k19-1023
dblp:conf/conll/RouxRL19
fatcat:bhv7c2ouojfejoif377gcb25ci
*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 ...##
###
LLparse and LRparse

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

doi:10.1145/191029.191121
dblp:conf/sigcse/BlytheJR94
fatcat:jqisjnkozrcwbnmvvn2djkgw5y
*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. ...##
###
Type-Driven Automatic Quotation of Concrete Object Code in Meta Programs
[chapter]

2006
*
Lecture Notes in Computer Science
*

The

doi:10.1007/11751113_8
fatcat:mm6dgd6aprbobnbeqg7bl45rwi
*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. ...##
###
LLparse and LRparse

1994
*
ACM SIGCSE Bulletin
*

This paper describes instructional tools, LLparse and LRparse, for visualizing and interacting

doi:10.1145/191033.191121
fatcat:6l7hgm7gefaw3n3vyrfw7z4htm
*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. ...##
###
Data Language Specification via Terminal Attribution
[article]

2015
*
arXiv
*
pre-print

We introduce a notation in which grammars are defined by simply dividing terminals into predefined

arXiv:1511.00909v1
fatcat:drvrwhp6wfb5bbjs7gnxe7kw6a
*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. ...##
###
Simple chain grammars
[chapter]

1977
*
Lecture Notes in Computer Science
*

A very simple (bottom-up)

doi:10.1007/3-540-08342-1_27
fatcat:dyapxylnkjh6fjwewlbxctn2wa
*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. ...##
###
Parsing with C++ deferred expressions

1994
*
SIGPLAN notices
*

This paper presents an extension to that technique which allows

doi:10.1145/185009.185011
fatcat:hozbrgdfwrfvvjh6tul4si3aiq
*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. ...##
###
Parse Forest Diagnostics with Dr. Ambiguity
[chapter]

2012
*
Lecture Notes in Computer Science
*

We

doi:10.1007/978-3-642-28830-2_16
fatcat:m5hzy5amljgdfktgtkma7tyrgq
*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*. ...##
###
Simplified Parsing Expression Derivatives
[chapter]

2020
*
Lecture Notes in Computer Science
*

This paper presents a new

doi:10.1007/978-3-030-40608-0_30
fatcat:kao6hlfa2baitflsbyxwie4ukm
*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. ...##
###
Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States

2016
*
Transactions of the Association for Computational Linguistics
*

This is accomplished

doi:10.1162/tacl_a_00092
fatcat:j6v6gxsyx5eyxmvpcb4xqcweha
*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*. ...##
###
The hierarchy of LR-attributed grammars
[chapter]

1990
*
Lecture Notes in Computer Science
*

The problem of attribute evaluation during LR

doi:10.1007/3-540-53101-7_2
fatcat:c5q7tt2mrrcrpitdnixmckuv2y
*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 ...##
###
Formal Grammars and Languages
[chapter]

1998
*
Algorithms and Theory of Computation Handbook
*

It turns out that in bottom-up

doi:10.1201/9781420049503-c26
fatcat:x3mj3ftb5rhf3nih23b7dr4l54
*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. ...##
###
Formal Grammars and Languages
[chapter]

2009
*
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1
*

It turns out that in bottom-up

doi:10.1201/9781584888239-c20
fatcat:k4e5ivi7ujgpbkb47nectsjwxi
*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. ...
« Previous

*Showing results 1 — 15 out of 80,266 results*