Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Are two context-free languages translatable in a syntax-directed translation scheme?

From MaRDI portal
Publication:1217456
Jump to:navigation, search

DOI10.1007/BF02575634zbMath0305.68009OpenAlexW2038474830MaRDI QIDQ1217456

S. Singh

Publication date: 1974

Published in: Calcolo (Search for Journal in Brave)

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


Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)



Uses Software

  • ALGOL 60


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Properties of syntax directed translations
  • Syntax directed translations and the pushdown assembler
  • A syntax directed compiler for ALGOL 60
  • Some Recursively Unsolvable Problems in ALGOL-Like Languages
  • Syntax-Directed Transduction
  • Semantics of context-free languages
  • Operations Which Preserve Definability in Languages
  • Translations on a context free grammar
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1217456&oldid=13287043"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki