Live briefing
Everything about LL parser
Top-down parser that parses input from left to right
In computer science, an LL parser is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost derivation of the sentence. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: LL parserA 5-minute orientation
- Skim a recent paper: DPAM : A domain parser for AlphaFold modelsInfluential work since 2022
- Pick up a classic book: Languages and machinesThe most-reprinted book on the subject
- Read the landmark paper: ACPYPE - AnteChamber PYthon Parser interfacECited 3,001 times
- Go sideways: LR parserA closely related topic
- Go sideways: SLR grammarA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
ACPYPE - AnteChamber PYthon Parser interfacE
ANTLR: A predicated‐ LL ( k ) parser generator
PARSER: A Model for Word Segmentation
PDB file parser and structure class implemented in Python
Poly peak parser: Method and software for identification of unknown indels using sanger sequencing of polymerase chain reaction products
COD::CIF::Parser : an error-correcting CIF parser for the Perl language
🆕 Influential since 2022
DPAM : A domain parser for AlphaFold models
SeTransformer: A Transformer-Based Code Semantic Parser for Code Comment Generation
No More Labelled Examples? An Unsupervised Log Parser with LLMs
SAM-PARSER: Fine-Tuning SAM Efficiently by Parameter Space Reconstruction
Concept Parser With Multimodal Graph Learning for Video Captioning
📚 Books worth reading
Languages and machinesThomas A. Sudkamp · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- LR parser In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants…
- SLR grammar SLR grammars are the class of formal grammars accepted by a Simple LR parser. SLR grammars are a superset of all LR(0) grammars and a subset of all LALR(1)…
- Canonical LR parser A canonical LR parser (also called a LR(1) parser) is a type of bottom-up parsing algorithm used in computer science to analyze and process programming…
- Shift-reduce parser A shift-reduce parser is a class of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by a…
- Packrat parser The Packrat parser is a type of parser that shares similarities with the recursive descent parser in its construction. However, it differs because it takes…
- Simple precedence grammar In computer science, a simple precedence grammar is a context-free formal grammar that can be parsed with a simple precedence parser. The concept was first…
- Top-down parsing language Top-Down Parsing Language (TDPL) is a type of analytic formal grammar developed by Alexander Birman in the early 1970s in order to study formally the behavior…
- Context-free grammar In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of…