PIRL—Pattern Information Retrieval Language—design of syntax

Authors:
Sidney Berkowitz
Affiliations:
-
Venue:
ACM '71 Proceedings of the 1971 26th annual conference
Year:
1971

Citing 4
Cited 0

An ALGOL-based associative language

Communications of the ACM
A programmer's description of L6

Communications of the ACM
A generalized technique for symbol manipulation and numerical calculation

Communications of the ACM
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Quantified Score

Hi-index	0.00

Visualization

Abstract

The design of a pattern manipulation language, PIRL, is described here. PIRL can handle arbitrary, oriented patterns (i. e., subgraphs) of lists, nodes, numeric and Hollerith data on many levels of abstraction in a concise, legible manner. Patterns and lists may be inserted, retrieved, deleted, indexed, compared, named, intersected, united, and complemented. Pattern names may be referenced to a lower level of abstraction and pattern forms may be quantified. PIRL should be of considerable value in the solution of certain problems in information retrieval, linguistic analysis, scheduling simulation, and pattern recognition.