Syntactic recognizer for expandable languages

DOI10.1007/BF02367763zbMath0837.68062MaRDI QIDQ1905217

V. V. Gusev, T. N. Galagan

Publication date: 8 January 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

parsing algorithm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Unnamed Item
• A programming language with an expandable grammar
• Syntactic adaptability of programming languages
• Optimization of LR(k) parsers
• An efficient context-free parsing algorithm
• On the translation of languages from left to right
• Some remarks on the syntax of symbolic programming languages

This page was built for publication: Syntactic recognizer for expandable languages