Syntactic recognizer for expandable languages

DOI10.1007/BF02367763MaRDI QIDQ1905217zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3473266 (Why is no real title available?)
• A programming language with an expandable grammar
• An efficient context-free parsing algorithm
• On the translation of languages from left to right
• Optimization of LR(k) parsers
• Some remarks on the syntax of symbolic programming languages
• Syntactic adaptability of programming languages

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

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