Maybe someone can help. I have several thousand program modules (COBOL,
PL/1, 4GL, SQL, PowerBuilder, etc.) that must be re-engineered to run in
a Java Enterprise environment. And they want it by years end <chuckle>.
I'm thinking I'll write parsers to reduce the code into a common
format. From there I will be able to refactor and then generate the
code into Java. But I can't seem to visualize this common format.
This intermediate structure would be the parse tree hierarchy: module,
function,
declarations, imperative statements, etc. It would be no problem to
generate Jess facts to represent a program module, but how would Jess
rules
operate on a hierarchy?
So, here's my question: how _do_ I represent this knowledge? Am I
better-off in Lisp? Does anyone know someone who has done this before?
Thanks for your help,
Mike
--
Michael Welter
Denver, Colorado, USA
__o Phone: +1 303 674 2575
_ \<,_ Fax: +1 303 670 1918
(_)/ (_) e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]'
in the BODY of a message to [EMAIL PROTECTED], NOT to the
list (use your own address!) List problems? Notify [EMAIL PROTECTED]
---------------------------------------------------------------------
