SR(s,k) parsers: A class of shift-reduce bounded-context parsers

DOI10.1016/0022-0000(81)90026-XzbMath0472.68050OpenAlexW2052944130MaRDI QIDQ1157922

David A. Workman

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90026-x

zbMATH Keywords

lookaheadbottom-up parsersweak precedence grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Uses Software

• ALGOL 60
• Euler

Cites Work

• Characteristic parsing: A framework for producing compact deterministic parsers. II
• EULER: A generalization of ALGOL and its formal definition: Part 1
• An efficient context-free parsing algorithm
• A technique for generating almost optimal Floyd-Evans productions for precedence grammars
• On the translation of languages from left to right
• Bounded context syntactic analysis

This page was built for publication: SR(s,k) parsers: A class of shift-reduce bounded-context parsers