15.11.2001: (Gruppenarbeit & Berichte: Arbeiten mit Parsern)

The implementations to be discussed in group work are rather different from the implementation in LISP, which is a functional programming language. They use a variety of C, whih is an imperative programming language.

Tasks:

1. Describe each of the following implementations, using the following schema:

   Requirements:

   Describe the functionality (i.e. the input/output behaviour) of the program. Standard: easy.

   Design:

   Describe the modules in the program, their interfaces (parameters, parameter data structures). Standard: medium-hard.

   Implementation:

   Describe the pogramming strategy, and peculiarities of the programming language used. Standard: hard.

   Evaluation:

   Describe whether the program matches the requirements specification, how it could be improved, ... Standard: hardest.

2. Check the web for interactive parser demonstrations. Try this and this, the latter together with a lexicon tool.

 
• Explanation of examples
• Example 1: An interpreted deterministic top-down, left-right recursive descent context-free recogniser
• Example 2: A compiled non-deterministic top-down left-right recursive descent context-free recogniser
• Example 3: A compiled non-deterministic top-down left-right recursive descent context-free parser
• Output from the Example 3 parser