APAREL—A parse-request language

@article{Balzer1969APARELAPL,
  title={APAREL—A parse-request language},
  author={R. Balzer and D. Farber},
  journal={Commun. ACM},
  year={1969},
  volume={12},
  pages={624-631}
}
  • R. Balzer, D. Farber
  • Published 1969
  • Computer Science
  • Commun. ACM
  • APAREL is described: this language is an extension to an algorithmic language (PL/I) that provides the pattern-matching capabilities normally found only in special purpose languages such as SNOBOL4 and TMG. This capability is provided through parse-requests stated in a BNF-like format. These parse-requests form their own programming language with special sequencing rules. Upon successfully completing a parse-request, an associated piece of PL/I code is executed. This code has available for use… CONTINUE READING
    A syntax-directed parser for recalcitrant grammars
    • 3
    Pattern matching for high level languages
    • 5
    The ISPL Language Specifications
    • 1
    • PDF
    USER'S MANUAL FOR APAREL: A PARSE-REQUEST LANGUAGE
    Continuous system simulation languages: Design principles and implementation techniques
    • 1
    Augmented phrase structure grammars
    • 62
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Dataless Programming, The RAND Corporation, RM-5290-ARPA
    • 1967
    Ed.) C P L W o r k i n g Papers
    • 1966