On non-hierachical systems of binary operators

  • Authors:
  • D. J. Cooke

  • Affiliations:
  • Loughborough University of Technology, Loughborough, UK

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a previous paper [3] a system was described by which context-sensitive grammars could be used to specify balanced derivations of certain expressions; such derivations corresponding in a natural way to balanced semantic trees appropriate for parallel execution. The earlier work was only applicable to expressions involving a strictly ordered hierachy of binary operators. This note shows how under certain "reasonable" algebraic constraints the method can be extended to less well-behaved situations.