Parsers for Deterministic Context-Free Languages: LL(k) Parsers

Alberto Pettorossi

doi:10.1007/978-3-030-63189-5_4

ScienceGate Book Chapters

BOOK-CHAPTER

Parsers for Deterministic Context-Free Languages: LL(k) Parsers

Alberto Pettorossi

Year: 2021 Pages: 47-83

DOI: 10.1007/978-3-030-63189-5_4

Get Full-Text PDF Get Analytical Report

Keywords:

Parsing LR parser Computer science Context (archaeology) Rule-based machine translation Context-free grammar Programming language Context-free language Artificial intelligence Natural language processing Top-down parsing History

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.36

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Natural Language Processing Techniques

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Algebra and Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Parsers for Deterministic Context-Free Languages: LL(k) Parsers

Metrics

Topics

Related Documents

Parsers for Deterministic Context-Free Languages: LR(k) Parsers

On constructing LL(k) parsers

Extended LL(k) grammars and parsers

Chop-and-Expand Parsers for Context-Free Languages

Generalized Deterministic Parsers