Some observations on LR-like parsing with delayed reduction

DOI10.1016/J.IPL.2007.07.003zbMATH Open1184.68306OpenAlexW2112685928MaRDI QIDQ2380022FDOQ2380022

Authors: Mark-Jan Nederhof, E. Bertsch 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.07.003

Recommendations

• scientific article; zbMATH DE number 194074
• Optimization of LR(\(k\)) reduced parsers
• On the reduction of \(LR(k)\) parsers
• Efficient \(LR(1)\) processor construction
• SLR(1) and LALR(1) parsing for unrestricted grammars

zbMATH Keywords

formal languagesparsinggrammars\(LR(k)\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Noncanonical LALR(1) Parsing
• Noncanonical Extensions of Bottom-Up Parsing Techniques
• Title not available (Why is that?)
• Noncanonical SLR(1) Grammars
• Recursive ascent parsing: From Earley to Marcus

Cited In (3)

• Redundancy of the Lempel-Ziv incremental parsing rule
• On the prediction of reduction goals: A deterministic approach
• Producing the left parse during bottom-up parsing

This page was built for publication: Some observations on LR-like parsing with delayed reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380022)