 ;;         (no-prod . "")
 ;;         (no-sum  . "")))
 
-;; Given just this grammar, the parser will return an s-expression of
-;; the input where each token match is `cons'ed with the token
-;; name. To make this more useful, the s-expression can be manipulated
-;; as it is read using an alist of token names and functions. This
-;; could be used to simplify the s-expression, build an interpreter
-;; that interprets during parsing, or even build a compiler.
+;; Given just this grammar to `rdp-parse' it will return an
+;; s-expression of the input where each token match is `cons'ed with
+;; the token name. To make this more useful, the s-expression can be
+;; manipulated as it is read using an alist of token names and
+;; functions. This could be used to simplify the s-expression, build
+;; an interpreter that interprets during parsing, or even build a
+;; compiler.
 
 ;; For example, this function alist evaluates the arithmetic as it is
 ;; parsed:

;; * list   -- "and" relationship, each pattern must match in order
;; * vector -- "or" relationship, one of the patterns must match
;; * symbol -- recursive reference to another pattern in the alist

;; For example, this grammar parses simple arithmetic with operator
;; precedence and grouping.

;; This library provides a recursive descent parser for parsing
;; languages in buffers. Some support is provided for implementing
;; automatic indentation based on the parser.

;; In general, the only two functions you need to worry about are:

;; * `rpd-parse'        -- parse the current buffer
;; * `rpd-parse-string' -- parse a string (in a temp buffer)

;; A grammar is provided to the parser as an alist of patterns.
;; Patterns are named by symbols, which can reference other
