next up previous contents
Next: Arbitrary equations systems Up: Input languages Previous: Recursive Markov Decision Processes   Contents

Stochastic Context Free Grammar s

To give Stochastic Context Free Grammar as an input the user specify a set of productions, one on each line. Each production specifies firstly the probability of this productions, then the non-terminal that we will be replacing, a symbol -> followed by any sequence of terminals and non-terminals. The user does not have to specify which symbols are terminals as the program assumes that any symbol without a production attached to it is a terminal. For an example SCFG shown on the fig. 3, the only terminal is $ D$ and the non-terminals are $ A$, $ B$ and $ C$.

Figure 3: Source code of an example Stochastic Context Free Grammar

A formal grammar of the input language for Stochastic Context Free Grammar s is defined in 4.3.

Dominik Wojtczak 2006-10-31