Generation, recognition and parsing of context-free languages by means of recursive graphs

DOI10.1007/BF02239477MaRDI QIDQ2559926zbMATH OpenOpenAlexFDO

Authors F. P. Kaminger

Publication date 1973

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02239477

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Design of a separable transition-diagram compiler
• scientific article; zbMATH DE number 3490487 (Why is no real title available?)
• scientific article; zbMATH DE number 3562548 (Why is no real title available?)
• scientific article; zbMATH DE number 3633745 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On context-free languages and push-down automata
• On the translation of languages from left to right
• Syntax-Directed Transduction

This page was built for publication: Generation, recognition and parsing of context-free languages by means of recursive graphs

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