Fall 2012 CS345 Project Requirements and Suggestions (Version 4)

Transcription

1 Fall 2012 CS345 Project Requirements and Suggestions (Version 4) Languages developed or modified for your project should have the following properties unless there is a good reason not to (e.g., you re modifying ReL), which you will need to explain: Tracing of Operations to demonstrate concepts that have been implemented. Differed Substitution First-class Functions Static Scoping with optional Dynamic Scoping if appropriate Static or Dynamic Typing Interpretation of an Abstract Syntax Tree Be very careful not to do a project that simply translates one programming language syntax into another programming language syntax. Project teams need to be 2 or 3 people. Project suggestions: A. Combination Project (do 1 and 2 below): 1. Lisp is on the rise again: lambdas in java 8 (see and lisp/javascript (see Using crono (crono.zip on the website) and FAE as guides, build a lisp interpreter using javacc that implements FAE but with lisp/scheme syntax. The Parser should convert lets to lambda applications as in Homework 4, problem 3 but it should build an AST that the interpreter uses by visiting the nodes on the AST. Also, the interpreter should build an Environment that prints out like FAE but with lisp/scheme syntax (e.g., (asub f (closure y (+ x y) (asub x 3 (mtsub))) (asub x 3 (mtsub))). Also, be able to print the AST by visiting the nodes on the AST. Note: the following works in crono (\ is lambda) and its equivalent works in FAE and should work in your interpreter, however, FAE, with static scoping, does not support recursion, so your interpreter needn t either. java crono/crono ((let ((f (\ (x) x))) f) (let ((x 4)) x)) Evaluating: ((let ((f (\ (x) x))) f) (let ((x 4)) x)) Evaluating: (let ((f (\ (x) x))) f) Evaluating: (\ (x) x) Result: (\ (x) x) [] Result: (\ (x) x) []

2 Evaluating: (let ((x 4)) x) Result: 4 Result: 4 2. Choose one of the following: Modify ReL+HWs to include SQL subquery (see Chapter 7 of the recommended Schaum book). You will need to (1) modify Python.g to include the syntax for subqueries, and (2) modify SQLVisitor.java to visit subquery nodes in the jsqlparser AST to produce SPARQL. [This would be a great way to learn SQL and the Visitor Pattern (see Andrew s Visitor Paper on the class website)]. Here s a paper on subqueries in sparql It turns out that our version of Oracle doesn t support what s in this paper so we ll have to do something like what s in bold below for a subquery: SELECT firstname, lastname, zipcode, personid from table( sem_match('select * where {?indiv rdf:type :PERSONT.?indiv :firstname?firstname.?indiv :lastname?lastname.?indiv :zipcode?zipcode.?indiv :personid?personid. }', SEM_MODELS('RDF_MODEL_CS345_prof1'), sem_rulebases('owl2rl'), SEM_ALIASES( SEM_ALIAS('', ' null) ) where zipcode in ( SELECT zipcode from table(sem_match('select * where {?indiv rdf:type :PERSONT.?indiv :zipcode?zipcode.?indiv :zipcode "61511". }', SEM_MODELS('RDF_MODEL_CS345_prof1'), sem_rulebases('owl2rl'), SEM_ALIASES( SEM_ALIAS('', ' null) ) ) Here s how to fix up the existing subquery non- terminal in Python.g ATNLR has syntatic predicates which are like lookaheads, which help remove global backtracking from the grammar.

3 Here is the source: al+backtracking+from+your+grammar "Before you go further, check if the input conforms to the following rules. If yes, then take this path, if no, try the next alternative." This is the example given: a : (L K)=> b c b : L K c : L M Following these rules, now the ambiguity that existed when processing subqueries is gone. Here is wht needs to be added to python.g sqlsubquery : (LPAREN SELECT) => LPAREN SELECT {$sql_stmt::temp += "(SELECT "} subquery subquery : sqlquery RPAREN What is great is that it takes arbitrary number of subqueries. So now grammar is able to parse an statement as follows: SELECT PETS.NAME, PETS.TYPEID FROM PETS WHERE PETS.TYPEID = (SELECT PETS.TYPEID FROM PETS WHERE PETS.BIRTH_YEAR = (SELECT PETS.BIRTH_YEAR FROM PETS WHERE PETS.PETID = 1001)) Which results in the statement being reached by the visitor that handles subqueries. Integrate the SQL and SIM grammars, i.e., simplify the two grammars in Python.g into one grammar. [This would be a great way to learn more about SQL, SIM and EBNF]. EVAs in the SIM language map directly to owl:inverseof. Enhance the SIM language with new constructs of your own design that map directly to the other inferencing mechanisms in owl. Add Oracle OLAP syntax (see ) to ReL and map it to RDF using the standard vocabulary. [This would be a great way to get an introduction to data warehousing techniques.]

4 Enhance SIM to make use of the standard organization vocabulary (see ). Investigate the Protégé Ontology Library (see ) to find something interesting to integrate into ReL. Adapt the prolog (and/or) ASP capabilities in ReL to use the 3 rd Party Callouts Framework shown on page 19 of Souri Das s presentation. B. Lisp/Scheme Project: Continue on from A1 above and add the following: multiple binding instances in lets multiple parameters in lambdas support for recursion (please see PLAI, Chapters 9 and 10) whole number combinators preloaded into the Environment (see PLAI1 Notes, page 25 and Integrated_crono.zip on the website as guides, especially notice how crono prints a trace of the combinators as they re being evaluated) which means recursion must now be supported. car, cdr, cons preloaded into the Environment list combinators preloaded into the Environment (see PLAI1 Notes, page 26 as a guide). foldr using the list combinators preloaded into the Environment (see prfoldr in Haskell 2 Notes, page 34) C. ReL Projects (do one of the following): 1. Build a jsimparser using javacc and integrate it into ReL. You could gut jsqlparser and rebuild it for the SIM language or you could modify the parser that s part of Bo Li s thesis work (see Bo s SIM Code on the class website). Bo used jjtree (which is part of javacc) to build the AST so this would be a good way to learn it. 2. Modify the Jython system such that some of its object-oriented features populate an RDF database. For instance, if a class is defined, the class definition information (t-box information (see Google)) excluding method information should go into the database. If pickle is used, the state information for that instance (a-box information) should be inserted into the database. Then build a mechanism that will allow properties such as REQUIRED, MV, INVERSE to be added to the a-box data and thereby be inferencable. 3. Add LDAP syntax (along with conversion to SPARQL) to ReL. See which is a site that talks about the standards for LDAP. Section 4 is where it starts talking about what each operation should accept. Make sure LDAP expressions can have python

5 expressions in them where appropriate, it might be easiest to have a special sytax for python expressions like _ exp _ 4. Add another interesting (talk to Dr. Cannata about this) language syntax (along with conversion to SPARQL) to ReL. 5. Add ReL capabilities to the berp system (see ) D. Hmm Project: Enhance Hmm (use hmm_visitor.zip from the class website as your base) to have an owl-like inferencing, object-oriented nature (you ll need to build your own primitive inferencing engine or find one on the web to incorporate into your project. Have a look at ILOG JRULES, Drools and you might want to check Open Source Rule Engines in Java) and compare this to java. E. Crono Project: Enhance Crono (use integrated_crono.zip from the class website as your base) to have an owl-like inferencing, object-oriented nature (you ll need to build your own primitive inferencing engine or find one on the web to incorporate into your project. Have a look at ILOG JRULES, Drools and you might want to check Open Source Rule Engines in Java) and compare this to java. F. With Dr. Cannata s pre-approval, build something from scratch. Note: no natural language-like (e.g., English-like) programming languages will be allowed because I know, at this point in history, it can t be done. (Yes, that is a challenge that you could take up in the future.) G. 20% Extra Credit (if you get an A on the actual project, you will then be eligible for extra credit points) Get a Visualizer to work with ReL, for example see Cytoscape as shown on on page 19 of Souri Das s presentation. Suggest another Extra Credit for Dr. Cannata to consider.