|
This is " This language consists of a bare-bone syntax and operational semantics for order-sorted feature (OSF) terms - also known as ψ-terms - and basic operations for them. It first focuses on defining a multiple-inheritance concept hierarchy of sort symbols. It implements the machinary for compiling these sorts into binary codes to optimize lattice operations on them. This will be used in later versions when implementing ψ-terms unification and generalisation. Essentially, this simple language is meant as an initial prototype for declaring a sort lattice, implementing binary encoding of sort ordering using bit vectors, evaluation of sort expressions, and reading and pretty-printing ψ-terms. It also offers interactive pragmas for exploring a sort hierarchy. This initial version does not support OSF term unification or generalisation, term disjunction nor negation yet (other than on sort symbols), no residuation, no OSF theories, and no monoidal aggregation. It does not provide rules either (whether logic programming or functional rewriting). Also, the ψ-terms are kept in their original labelled-graph form (i.e., they are not dissolved into basic OSF constraints). All this will come gradually in later versions extending this basic one. Import the grammar file OsfV1Grammar.grm
This defines the grammar rules and semantic actions for the "OSF V1" language. This language can be run both interactively and in batch mode. In the former case, a user can declare sorts, define variables, execute pragmas, and evaluate expressions. In batch mode, the parser must be invoked on one or several input files from a Java application, with its interactive options turned off and output redirected to a file or the console. This is part of the OSF V1 language grammar and contains its declarations. This file defines ancillary code (global variables and methods) for the OSF V1 language. It is part of its Jacc grammar specification and is included by the main grammar file OsgV1Grammar.grm . This is an auxiliary file for the OSF V1 language grammar defining the node classes for the objects used in its semantic rules.
|
Copyright © 2013 by Hassan Aït-Kaci; All Rights Reserved.