Parse a list of one or more initializer declarators.
(parse-init-declarator-list pstate) → (mv erp initdeclors span new-pstate)
We parse the first one, which must be present. If there is a comma after that, we recursively parse one or more after the comma.
Function:
(defun parse-init-declarator-list (pstate) (declare (xargs :guard (parstatep pstate))) (let ((__function__ 'parse-init-declarator-list)) (declare (ignorable __function__)) (b* (((reterr) nil (irr-span) (irr-parstate)) ((erp initdeclor span pstate) (parse-init-declarator pstate)) ((erp token & pstate) (read-token pstate))) (cond ((equal token (token-punctuator ",")) (b* (((erp initdeclors last-span pstate) (parse-init-declarator-list pstate))) (retok (cons initdeclor initdeclors) (span-join span last-span) pstate))) (t (b* ((pstate (if token (unread-token pstate) pstate))) (retok (list initdeclor) span pstate)))))))
Theorem:
(defthm initdeclor-listp-of-parse-init-declarator-list.initdeclors (b* (((mv acl2::?erp ?initdeclors ?span ?new-pstate) (parse-init-declarator-list pstate))) (initdeclor-listp initdeclors)) :rule-classes :rewrite)
Theorem:
(defthm spanp-of-parse-init-declarator-list.span (b* (((mv acl2::?erp ?initdeclors ?span ?new-pstate) (parse-init-declarator-list pstate))) (spanp span)) :rule-classes :rewrite)
Theorem:
(defthm parstatep-of-parse-init-declarator-list.new-pstate (b* (((mv acl2::?erp ?initdeclors ?span ?new-pstate) (parse-init-declarator-list pstate))) (parstatep new-pstate)) :rule-classes :rewrite)
Theorem:
(defthm parsize-of-parse-init-declarator-list-uncond (b* (((mv acl2::?erp ?initdeclors ?span ?new-pstate) (parse-init-declarator-list pstate))) (<= (parsize new-pstate) (parsize pstate))) :rule-classes :linear)
Theorem:
(defthm parsize-of-parse-init-declarator-list-cond (b* (((mv acl2::?erp ?initdeclors ?span ?new-pstate) (parse-init-declarator-list pstate))) (implies (not erp) (<= (parsize new-pstate) (1- (parsize pstate))))) :rule-classes :linear)