Context-free grammars with lookahead

DOI10.1007/978-3-030-68195-1_16OpenAlexW3130625959MaRDI QIDQ2232284

Yasuhiko Minamide, Takayuki Miyazaki

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_16

zbMATH Keywords

regular expressionscontext-free grammarsdenotational semanticsparsinglookaheadformal language theoryparsing expression grammarssyntactic predicates

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Translating regular expression matching into transducers
• Tree adjunct grammars
• Boolean grammars
• An extension of context-free grammars with one-sided context specifications
• Parsing expression grammars
• Top-down tree transducers with regular look-ahead
• Parsing with derivatives
• Linear grammars with one-sided contexts and their automaton representation
• Indexed Grammars—An Extension of Context-Free Grammars
• Derivatives of Regular Expressions
• Linear Parsing Expression Grammars

This page was built for publication: Context-free grammars with lookahead