We present algorithms for the construction of LALR(1) parsing tables, and of LR(1) parsing tables of reduced size. We first define specialized characteristic automata whose states are parametric w.r.t. variables symbolically representing lookahead-sets. The propagation flow of lookaheads is kept in the form of a system of recursive equations, which is resolved to obtain the concrete LALR(1) table. By inspection of the LALR(1) automaton and of its lookahead ropagation flow, we decide whether the grammar is LR(1) or not. In the positive case, an LR(1) parsing table of reduced size is computed by refinement of the LALR(1) table.

A translation of Systems Biology Markup Language (SBML) into a process algebra is proposed in order to allow the formal specification, the simulation and the formal analysis of biological models. Beta-binders, a language with a quantitative stochastic extension, is chosen for the translation. The proposed translation focuses on the main components of SBML models, as species and reactions. Furthermore, it satisfies the compositional property, i.e. the translation of the whole model is obtained by composing the translation of the subcomponents. An automatic translator tool of SBML models into Beta-binders has been implemented as well. Finally, the translation of a simple model is reported.

The need for a more formal handling of biological information processing with stochastic and mobile process algebras is addressed. Biology can benefit this approach, yielding a better understanding of behavioural properties of cells, and computer science can benefit this approach, obtaining new computational models inspired by nature.