Logical programming for the telegram analysis problem

Koji Torii, Yuji Sugiyama, Mamoru Fujii, Tadao Kasami, Yoshitomi Morisawa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The telegram analysis problem posed by Henderson and Snowdon has been repeatedly taken into account. This paper adds yet another contribution to the literature on this problem. We propose rigorous specification methods, and describe how programs can be derived from BNF to Definite Clause Grammar in Prolog by two different methods. One method is especially useful for large scale problems and has been applied to file manipulation, and the other is applicable to simple problems.

Original languageEnglish
Pages (from-to)9-20
Number of pages12
JournalComputer Languages
Volume12
Issue number1
DOIs
Publication statusPublished - 1987

Keywords

  • Attribute grammar
  • Backus-Naur Form
  • Definite Clause Grammar
  • Formal specification
  • Prolog
  • Telegram analysis problem

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Logical programming for the telegram analysis problem'. Together they form a unique fingerprint.

  • Cite this

    Torii, K., Sugiyama, Y., Fujii, M., Kasami, T., & Morisawa, Y. (1987). Logical programming for the telegram analysis problem. Computer Languages, 12(1), 9-20. https://doi.org/10.1016/0096-0551(87)90008-7