View in EDS PDF Full Text

Translation Equations.

Saved in:
Bibliographic Details
Title: Translation Equations.
Authors: Vere, Steven1
Source: Communications of the ACM. Feb1970, Vol. 13 Issue 2, p83-89. 7p. 1 Chart.
Subjects: Translators (Computer programs), Machine theory, Translating & interpreting, Parsing (Computer grammar), Fuzzy automata, Semantics
Abstract: Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described, string recognition and parsing may be treated as special cases of the translation problem. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5221502
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Translation Equations.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Vere%2C+Steven%22">Vere, Steven</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Feb1970, Vol. 13 Issue 2, p83-89. 7p. 1 Chart.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Translators+%28Computer+programs%29%22">Translators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Translating+%26+interpreting%22">Translating & interpreting</searchLink><br /><searchLink fieldCode="DE" term="%22Parsing+%28Computer+grammar%29%22">Parsing (Computer grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Fuzzy+automata%22">Fuzzy automata</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described, string recognition and parsing may be treated as special cases of the translation problem. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5221502
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/362007.362031
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 83
    Subjects:
      – SubjectFull: Translators (Computer programs)
        Type: general
      – SubjectFull: Machine theory
        Type: general
      – SubjectFull: Translating & interpreting
        Type: general
      – SubjectFull: Parsing (Computer grammar)
        Type: general
      – SubjectFull: Fuzzy automata
        Type: general
      – SubjectFull: Semantics
        Type: general
    Titles:
      – TitleFull: Translation Equations.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Vere, Steven
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb1970
              Type: published
              Y: 1970
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 13
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1