A method for proving programming languages non context-free

DOI10.1016/0020-0190(78)90080-7MaRDI QIDQ1249046zbMATH OpenOpenAlexFDO

Authors Stefan Sokołowski

Publication date 1978

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(78)90080-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• On the nonexistence of a phrase structure grammar for ALGOL 60
• Revised report on the algorithmic language ALGOL 60

Cited in

(7)

• The interchange or pump (di)lemmas for context-free languages
• Comparisons of Parikh's condition to other conditions for context-free languages
• A note on the sufficiency of Sokolowski's criterion for context-free languages
• Extensions of sokolowski's theorem to prove languages are not context free or not regular
• Comparisons between some pumping conditions for context-free languages
• On languages satisfying “interchange Lemma”
• On context-free and Szilard languages

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: A method for proving programming languages non context-free

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