Re: Call for Review: GCC introspector owl ontology

[James Michael DuPont <mdupont777 at yahoo dot com>]

--- Joe Buck <jbuck@synopsys.com> wrote:
> On Tue, Aug 19, 2003 at 12:09:13AM -0700, James Michael DuPont wrote:
> > Dear all,
> > Ashley winters and I have produced what is the first prototype for
> a
> > gcc ontology. It describes the facts extracted from the gcc using
> the
> > introspector.
> 
> Merriam-Webster defines ontology as follows:
> 
> 1 : a branch of metaphysics concerned with the nature and relations
> of being
> 2 : a particular theory about the nature of being or the kinds of
> existents
> 
> I don't think that this is the right term for a piece of code that
> produces XML output from a high-level language input.
>  
Your right. The ontology here is a description of the gcc tree nodes in
a very high level that allows you to *understand* the RDF/XML output .

The code that produces this data that matches this onto. is in my cvs,
very boring stuff.


I think that this onto. is interesting because it allows you to express
the high level semantics of the tree structures in a somewhat implement
ion independent manner.

When this is all done and %100 tested we should be able to generate
sets of c functions to process data from that ont, databases to store
it, and other things like perl and java classes to process the data as
well.

n3 coupled with CWM and Euler makes a logical programming language like
prolog, you can express data schemas but also proofs, filters and
algorithms in n3 /RDF format as well.

I hope that the proofs expressed in CWM and Euler can be translated
automatically into new c functions of the compiler in the very very
long term.

In any case this ont is meant to be human readable and editable, even
if not very pretty. Later on in a lowel level ont. it will contain
mapping to the exact gcc structures and functions that implement these
ASTS.

In any case this ONT should be of interest and value to anyone wanting
to study the gcc ASTS, not just someone who wants to deal with any
external represention.

The proofs expressed in n3 should be executable directly on the gcc
data structures in memory without any direct external represention when
we are able to map out all the data structures and generate  binding
code.

Then users will be able to write custom filter, algorithms and rules
that run inside the gcc for them on their own programs.


mike

=====
James Michael DuPont
http://introspector.sourceforge.net/

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free, easy-to-use web site design software
http://sitebuilder.yahoo.com