Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-03T02:01:34.282Z 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
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)