Read a specific keyword token.
This is called when we expect a specific keyword. We pass the string for the keyword, and we read the next token, ensuring it exists and it is that keyword.
Function:
(defun read-keyword (keywd pstate) (declare (xargs :guard (and (stringp keywd) (parstatep pstate)))) (let ((__function__ 'read-keyword)) (declare (ignorable __function__)) (b* (((reterr) (irr-span) (irr-parstate)) ((erp token span pstate) (read-token pstate)) ((unless (token-keywordp token keywd)) (reterr-msg :where (position-to-msg (span->start span)) :expected (msg "the keyword \"~s0\"" keywd) :found (token-to-msg token)))) (retok span pstate))))
Theorem:
(defthm spanp-of-read-keyword.span (b* (((mv acl2::?erp ?span ?new-pstate) (read-keyword keywd pstate))) (spanp span)) :rule-classes :rewrite)
Theorem:
(defthm parstatep-of-read-keyword.new-pstate (b* (((mv acl2::?erp ?span ?new-pstate) (read-keyword keywd pstate))) (parstatep new-pstate)) :rule-classes :rewrite)
Theorem:
(defthm parsize-of-read-keyword-uncond (b* (((mv acl2::?erp ?span ?new-pstate) (read-keyword keywd pstate))) (<= (parsize new-pstate) (parsize pstate))) :rule-classes :linear)
Theorem:
(defthm parsize-of-read-keyword-cond (b* (((mv acl2::?erp ?span ?new-pstate) (read-keyword keywd pstate))) (implies (not erp) (<= (parsize new-pstate) (1- (parsize pstate))))) :rule-classes :linear)