A bibliography on parallel parsing

Alblas, Henk; Akker, Rieks op den; Luttighuis, Paul Oude; Sikkel, Klaas

doi:10.1145/181577.181586

Cited by 9 publications

(9 citation statements)

References 93 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Such idealized results are, of course, not really comparable with experimental findings, as already asserted by [3], yet they offer some interesting indications. In particular, all the subfamilies of deterministic CF languages for which the theoretical complexity analysis reports a close to linear use of processors, are included in the family of OP languages we use.…”

Section: Related Workmentioning

confidence: 64%

“…Section 5 describes the architecture of our parser generator, and Section 6 presents the results of the benchmark campaign. Section 7 compares our approach to previous research on parallel parsers, while Section 8 presents our conclusions and possible further research directions 3 .…”

Section: Nmentioning

confidence: 99%

“…The valuable survey and bibliography [3] lists some two hundred publications in the period 1970 -1994, and research has continued since, though perhaps less intensively. It is worth contrasting this quantitative aspect with the paucity of existing realizations and, even more so, of tools for producing parallel parsers.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Parallel parsing made practical

Barenghi

Reghizzi

Mandrioli

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

The property of local parsability allows to parse inputs through inspecting only a bounded-length string around the current token. This in turn enables the construction of a scalable, data-parallel parsing algorithm, which is presented in this work. Such an algorithm is easily amenable to be automatically generated via a parser generator tool, which was realized, and is also presented in the following. Furthermore, to complete the framework of a parallel input analysis, a parallel scanner can also combined with the parser. To prove the practicality of a parallel lexing and parsing approach, we report the results of the adaptation of JSON and Lua to a form fit for parallel parsing (i.e. an operator-precedence grammar) through simple grammar changes and scanning transformations. The approach is validated with performance figures from both high performance and embedded multicore platforms, obtained analyzing real-world inputs as a test-bench. The results show that our approach matches or dominates the performances of production-grade LR parsers in sequential execution, and achieves significant speedups and good scaling on multicore machines. The work is concluded by a broad and critical survey of the past work on parallel parsing and future directions on the integration with semantic analysis and incremental parsing.

show abstract

Section: Related Workmentioning

confidence: 64%

Section: Nmentioning

confidence: 99%

See 1 more Smart Citation

Parallel parsing made practical

Barenghi

Reghizzi

Mandrioli

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Boolean grammars give us a formal instrument to model constructions such as ordered disjunction [11], forcefully rejected clauses [5], lookahead negation [6], quasisynchronisation [37], parallelism [2], etc. Such extensions on context-free grammars are common in practical software language processing and also used beyond the context of semiparsing.…”

Section: B Boolean Grammarsmentioning

confidence: 99%

Formal foundations for semi-parsing

Zaytsev

2014

2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)

View full text Add to dashboard Cite

Abstract-There exist many techniques for imprecise manipulation of source code (robust parsing, error repair, lexical analysis, etc), mostly relying on heuristic-based tolerance. Such techniques are rarely fully formalised and quite often idiosyncratic, which makes them very hard to compare with respect to their applicability, tolerance level and general usefulness. With a combination of recently developed formal methods such as Boolean grammars and parsing schemata, we can model different tolerant methods of modelling software and formally argue about relationships between them.

show abstract

“…Unlike many other languages, HTML5 is not defined with some clean, formal grammars, 1 but a collection of ad hoc rules and specifications. Most previous work on parallel parsers [Alblas et al 1994;Baccelli and Fleury 1982;Baccelli and Mussi 1986;Luttighuis 1989;Fischer 1975;Skillicorn and Barnard 1989] has targeted formally defined languages (e.g., in a context-free grammar) and leveraged the features of the grammars for parallelization. The ad hoc definition of HTML5 makes these techniques hard to be applied to its parsing.…”

Section: Special Challenges For Parallel Parsingmentioning

confidence: 99%

HPar

Zhao

Bebenita

Herman

et al. 2013

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Parallelizing HTML parsing is challenging due to the complexities of HTML documents and the inherent dependencies in its parsing algorithm. As a result, despite numerous studies in parallel parsing, HTML parsing remains sequential today. It forms one of the final barriers for fully parallelizing browser operations to minimize the browser's response time-an important variable for user experiences, especially on portable devices. This article provides a comprehensive analysis on the special complexities of parallel HTML parsing and presents a systematic exploration in overcoming those difficulties through specially designed speculative parallelizations. This work develops, to the best of our knowledge, the first pipelining and data-level parallel HTML parsers. The data-level parallel parser, named HPar, achieves up to 2.4× speedup on quadcore devices. This work demonstrates the feasibility of efficient, parallel HTML parsing for the first time and offers a set of novel insights for parallel HTML parsing

show abstract

A bibliography on parallel parsing

Abstract: This bibliography on parallel parsing and recognition of context-free languages covers most of the important publications in this area of computer science and natural language processing. The list of publications is preluded by an introduction which presents an overview of the field.

Cited by 9 publications

References 93 publications

Parallel parsing made practical

Parallel parsing made practical

Formal foundations for semi-parsing

HPar

Contact Info

Product

Resources

About