Skip to main content
SpringerLink
Log in

The Design of Interpreters, Compilers, and Editors for Augmented Transition Networks

  • Book
  • © 1983

Overview

Editors:
  1. Leonard Bloc

    1. Institute of Informatics, Warsaw University, Warszawa, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Symbolic Computation (SYMBOLIC)

Part of the book sub series: Artificial Intelligence (1064)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. The Planes Interpreter and Compiler for Augmented Transition Network Grammars

    • Timothy Wilking Finin
    Pages 1-69

  3. An ATN Programming Environment

    • Thomas Christaller
    Pages 71-148

  4. Compiling Augmented Transition Networks into MacLisp

    • Joachim Laubsch, Karl Barth
    Pages 149-174

  5. Towards the Elastic ATN Implementation

    • Krzysztof Kochut
    Pages 175-214

  6. Back Matter

    Pages 215-216
    Download chapter PDF
Back to top

Keywords

About this book

Augmented Transition Network Grammars are at present the most widely used method for analyzing natural languages. Despite the increasing po­ pularity of this method, however, no extensive papers on ATN-Grammars have been presented which would be accessible to a larger number of per­ sons engaged in the problem from both the theoretical and practical points of view. Augmented Transition Networks (ATN) are derived from state automata. Like a finite state automaton, an ATN consists of a collection of la­ beled states and arcs, a distinguished start state and a set of distin­ guished final states. States are connected with each other by arcs crea­ ting a directed graph or net. The label on an arc indicates a terminal symbol (word) or the type of words which must occur in an input stream to allow the transition to the next state. It is said that a sequence of words (or sentence) is accepted by such a net if there exists a se­ quence of arcs (usually called a path), connecting the start state with a final state, which can be followed to the sentence. The finite state automaton is then enriched by several facilities which increase its computational power. The most important of them permits some arcs to be labeled by nonterminal rather than terminal symbols. This means that the transition through such an arc is actually the re­ cursive application of the net beginning with a pointed state.

Editors and Affiliations

  • Institute of Informatics, Warsaw University, Warszawa, Poland

    Leonard Bloc

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation