+ count words, Common Lisp

Language: Layout:

;gnu clisp  2.49.60
;Задан текст, состоящий из символов. Текст содержит предложения. Признаком конца предложения является точка. 
;Построить список предложений. Для каждого предложения посчитать количество слов (слова отделяются пробелом). 
;Найти предложение, число слов в котором наибольшее. Найти в каждом предложении слово максимальной длины и построить список таких слов.

;Построить список предложений.
(defun list-of-sentences (text)
    
   (walk-across-text text 0 0 0)

)

(defun walk-across-text (text begin end count)
    (cond
        ((>= end (length text)) nil)
        ((eql (elt text end) #\.) (cons (list (subseq text begin (+ 1 end)) (+ count 1)) (walk-across-text text (+ end 2) (+ end 2) 0)))
        ((eql (elt text end) #\space) (walk-across-text text begin (+ end 1) (+ count 1)))
        (t (walk-across-text text begin (+ end 1) count))
        )
    
    )

;Для каждого предложения посчитать количество слов (слова отделяются пробелом). 
(defun count-words (sentences)
    (loop for s in sentences
          collecting (list s (+ (count #\SPACE s) 1))
          )
    )

;Найти предложение, число слов в котором наибольшее.
(defun max-count-words (sentences)
    (let (counts)) (setf counts (count-words  sentences))
    (let (max)) (setf max 0)
    (let (sent))
    (loop for c in counts
          if (> (second c) max)
              do (setf max (second c)) and do (setf sent (first c))
          finally (return (list sent max))
          )
    )

(defun max-word (sentence)
    (setf sentence (concatenate 'string sentence " "))
    (let (max)) (setf max 0)
    (let (pos)) (setf pos 0)
    (let (count)) (setf count (- (length sentence) 1))
    (let(len)) (setf len 0)
    (let (word))
    (loop while (< pos count)     
          do (setf len (- (position  #\SPACE sentence :start (+ 1 pos)) pos))
          if (> len max)
              do (setf max len) and
              do (setf word (subseq sentence (+ 1 pos)  (position  #\SPACE sentence :start (+ 1 pos)) ))  
          do (setf pos (position  #\SPACE sentence :start (+ 1 pos)))
          finally (return (list word max))
          )
    )

;Найти в каждом предложении слово максимальной длины и построить список таких слов.
(defun max-words-list (sentences)
    (loop for s in sentences collect (max-word s))
    )

#| Заданный текст
(let (text))
(setf text "I asked if your wife fully understood what you would be taking on here. And your son is also extraordinary. Ullman stood up and went to the file cabinet in the corner. He brought back five large sheets and set them down on the glossy walnut plane of the desk. Ullman whisked away the attic floor plan and put it on the bottom of the pile.")
(print text)
(let (sentences)) (setf sentences (list-of-sentences text))
(print "_______________________________________________________________")
(print "Список предложений и количество слов в них: ")
(print (count-words  sentences))
(print "_______________________________________________________________")
(print "Предложение с максимальным количеством слов: ")
(print (max-count-words  sentences))
(print "_______________________________________________________________")
(print "Самые длинные слова: ")
(print (max-words-list sentences))
|#
(let (text))
(setf text "I asked if your wife fully understood what you would be taking on here. And your son is also extraordinary. Ullman stood up and went to the file cabinet in the corner. He brought back five large sheets and set them down on the glossy walnut plane of the desk. Ullman whisked away the attic floor plan and put it on the bottom of the pile.")

(print (list-of-sentences text))

[ + ] Show input
Absolute running time: 0.16 sec, cpu time: 0.02 sec, memory peak: 10 Mb, absolute service time: 0,2 sec