/*
 * Bernoulli Compiler
 * Copyright (c) Cornell University
 * Department of Computer Science
 * 
 * Kamen Yotov (kamen@yotov.org)
 * 
 * $Source: C:/CVS/kyotov/kyotov/Research/BC/tasks.txt,v $
 * $Revision: 1.11 $
 * $Date: 2003/03/17 06:33:42 $
 */

creation of new variables
implement loop normalization
implement implementation defined keywords
make everything to use ASTs.Expression and its operators
implement fully asts_equivalent
implement custom converters to expression and statement
implement determinant computation of an integer matrix
check all the invalidoperationexceptions() and change them appropriately
may be never name internal omega variables
implement simple expression simplification pass
make the renderer use stringbuilder
fix everything to have only one namespace keyword in the beginning...

when walking do not modify the ancestors

redo stuff with ASTs.create
parse command line
throw out unneeded stuff from the AST...
merge types... (read the standard on combining types)...

look at ASTs.Expression as an C# design pattern example
look at ILP.Math as an C# design pattern example

new:
omega
math
ref parameters (walker)
parent