The following grammar Lsp is modelled after that of Lisp.

P -> E '.' E -> 'i' | '0' | 'q' | '(' S ')' S -> { E }

The Oberon module parseLsp.m is a skeleton recursive descent parser for Lsp. Fill in the details.