A Linear Parsing Algorithm For Parenthesis Terms

DOI10.1002/MALQ.19890350408MaRDI QIDQ4205089zbMATH OpenOpenAlexFDO

Authors Walter Felscher

Publication date 1989

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19890350408

zbMATH Keywords

Łukasiewicz notationMenger-Schröter algorithmparsing algorithmwell-formed parenthesis terms

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A yo-yo parsing algorithm for a large class of van Wijngaarden grammars
• Matching parentheses in parallel
• scientific article; zbMATH DE number 4119661
• scientific article; zbMATH DE number 4197438
• Simplified parsing expression derivatives

This page was built for publication: A Linear Parsing Algorithm For Parenthesis Terms

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