Logical programming for the telegram analysis problem

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

doi:10.1016/0096-0551(87)90008-7

Logical programming for the telegram analysis problem

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

Graduate School of Natural Science and Technology

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	9-20
Number of pages	12
Journal	Computer Languages
Volume	12
Issue number	1
DOIs	https://doi.org/10.1016/0096-0551(87)90008-7
Publication status	Published - 1987

Keywords

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

ASJC Scopus subject areas

Computer Science(all)

Access to Document

10.1016/0096-0551(87)90008-7

Cite this

@article{9c92cd6eef894585b79dcb0333e30ec2,

title = "Logical programming for the telegram analysis problem",

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.",

keywords = "Attribute grammar, Backus-Naur Form, Definite Clause Grammar, Formal specification, Prolog, Telegram analysis problem",

author = "Koji Torii and Yuji Sugiyama and Mamoru Fujii and Tadao Kasami and Yoshitomi Morisawa",

year = "1987",

doi = "10.1016/0096-0551(87)90008-7",

language = "English",

volume = "12",

pages = "9--20",

journal = "Computer Languages",

issn = "0096-0551",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - Logical programming for the telegram analysis problem

AU - Torii, Koji

AU - Sugiyama, Yuji

AU - Fujii, Mamoru

AU - Kasami, Tadao

AU - Morisawa, Yoshitomi

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

KW - Attribute grammar

KW - Backus-Naur Form

KW - Definite Clause Grammar

KW - Formal specification

KW - Prolog

KW - Telegram analysis problem

UR - http://www.scopus.com/inward/record.url?scp=0023169689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023169689&partnerID=8YFLogxK

U2 - 10.1016/0096-0551(87)90008-7

DO - 10.1016/0096-0551(87)90008-7

M3 - Article

AN - SCOPUS:0023169689

SN - 0096-0551

VL - 12

SP - 9

EP - 20

JO - Computer Languages

JF - Computer Languages

IS - 1

ER -

Logical programming for the telegram analysis problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this