Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T22:05:01.238Z Has data issue: false hasContentIssue false
  • English
  • Français

Jespersen's formalism: problems and extensions

Published online by Cambridge University Press:  17 May 2001

Sigfrido Di Giorgi
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 significant examples.

Information

Type
Research Article
Information
English Language & Linguistics , Volume 5 , Issue 1 , May 2001, pp. 131 - 158
Copyright
© 2001 Cambridge University Press