Jespersen's formalism: problems and extensions  

Oleh:

Giorgi, Sigfrido Di

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: English Language and Linguistics (Full Text & ada di PROQUEST th. 2005 - terbaru) vol. 5 no. 1 (May 2001), page 131-158.
Fulltext: vol5.1;131-158.pdf (155.31KB)

Ketersediaan

Perpustakaan PKBB Nomor Panggil: SS23 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This article aims to give a new, rigorous, and exhaustive presentation of Jespersen's formalism published in Analytic Syntax (1937). The formalism is described by means of the Backus metalinguistic formulas (Backus, 1959), which were universally adopted for the description of the syntax of computer programming languages. A modernized version of Jespersen's algorithm is proposed and illustrated with a number of signi®cant examples.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali