Run-time syntax extensions

Extensible languages are more and more popular now and bring many advantages. Such languages contain a relatively small base which a programmer can learn easily and are better adjustable for a particular problem { the code is then more legible, easier to debug and maintain. This work deals with the possibility of syntax extensions during the input text analysis, the input text can contain instructions for such extensions. An extension can be either permanent (valid to the input text end) or local (valid just temporarily). The work brings an implementation of an extensible parser based on kind grammars which supports permanent and local extensions