Skip to content
Parsing
Search
Ctrl
K
Cancel
Twitter
GitHub
Select theme
Dark
Light
Auto
Intro
Recently changed
Playground
Playground
About
Bugs
Changelog
Theory
Language
Grammar
Automata
Ambiguity
LL
LR
LR vs LL
Operators
Parse tree
Notation
Notation
Definitions
Abbreviations
Parsing with derivatives
PwD: Parsing with derivatives
Brzozowski derivative
Implementations
Parsing with zippers
PwZ: Parsing with zippers
PwZ implementations
Zipper
Grammar graph
Parse tree
PEG
Other
Extended Chomsky Hierarchy
language
Regular languages
Deterministic context free languages
Context free languages
Boolean languages
Context free with lookahead
Conjuctive languages
Context sensetive languages
Deterministic context sensetive languages
Deterministic Indexed languages
Indexed languages
Languages with context
PEG languages
RE with backreferences
RE with backreferences and lookahead
RE with lookahead
automata
DFA
FA
AFA
TFA
SFA
DPDA
PDA
2DPDA
2SA
APDA
DPPDA
EPDA
IDPDA
IPDA
LBA
MFA
NESA
NSA
SA
SAPDA
Scaffolding Automata
TSA
Parsers timeline
BNF
BSR
Courses about parsing
CRF
DAG
Dynamic programming
GSS
Incremental parsers
Interesting languages
LCRS
Left recursion
Markdown parser
Parser combinators
Playgrounds
Scannerless parser
SPPF
Twitter
GitHub
Select theme
Dark
Light
Auto
RE with backreferences
Regular expressions with backreferences
MFA - memory automata
Read more here:
On the Expressive Power of Regular Expressions with Backreferences, 2023
↗
Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition, 2024
↗