Generation, recognition and parsing of context-free languages by means of recursive graphs
From MaRDI portal
Publication:2559926
DOI10.1007/BF02239477zbMATH Open0258.68042OpenAlexW91077000MaRDI QIDQ2559926FDOQ2559926
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
Cites Work
- Title not available (Why is that?)
- Syntax-Directed Transduction
- Title not available (Why is that?)
- On the translation of languages from left to right
- On context-free languages and push-down automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Design of a separable transition-diagram compiler
- Title not available (Why is that?)
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)
