Home Home Uni Bielefeld BiBiServ Practical Computer Science Technische Fakultaet Home Applications Education Advanced Compiler HMM Literature Team

Matrix recurrence compilation

The recurrence compilation performs the translation scheme described in Towards a discipline of dynamic programming and generates traditional DP recurrences typeset in LaTeX.
Additionally, it determines the recurrences' dependency order and suitably arranges the recurrence calculations inside the outer loops (see Implementing ADP in the functional and the imperative programming paradigm).

Note that this is a preliminary version of the compilation. Areas that are subject to restrictions are:

  • Limited choice of terminal symbols and filters.
  • Some minor problems with the syntactic analysis. See the example grammars for correct input form.
  • Errors detected after the syntactic analysis phase will not be shown. The page simply won't load again or an "Internal Server Error" will be displayed. In these cases, press the "Back"-button of your browser to try again.

Input grammar:


Test with example:

Recurrences typeset in LaTeX:

Valid terminal symbols and filters

Terminal symbol  Language  Yield size  
empty L(empty)={}(0,0)
achar L(achar)=A(1,1)
astring L(astring)=A*(0,)
char c L(char c)={c}, c A(1,1)
string sL(string s)={s}, s A*(|s|,|s|)
minsize l
maxsize u   
size l u

| Author: psteffen | Date: 2006/02/03 18:02:31 |