Permalink
Browse files

Plurarize combinators in system/package name

  • Loading branch information...
1 parent 6633fc4 commit f5e912fdbf913d414c3d663092b6c44cf9a2fb2a @Ramarren committed Oct 24, 2008
Showing with 18 additions and 18 deletions.
  1. +1 −1 basic.lisp
  2. +1 −1 combinators.lisp
  3. +1 −1 greedy.lisp
  4. +1 −1 lazy.lisp
  5. +1 −1 memoize.lisp
  6. +1 −1 package.lisp
  7. +2 −2 parser-combinator-tests.asd
  8. +1 −1 parser-combinator.asd
  9. +1 −1 parsers.lisp
  10. +1 −1 primitives.lisp
  11. +2 −2 test-arithmetic.lisp
  12. +2 −2 test-parsers.lisp
  13. +3 −3 test-root.lisp
View
2 basic.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
;;; operate on list of tokens
View
2 combinators.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
;;; emulating monads... did I even understand those?
;;; bind :: Parser a -> (a -> Parser b) -> Parser b
View
2 greedy.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
;;; greedy version of repetition combinators
View
2 lazy.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
;;; emulate laziness as well, otherwhise any sort of recursion fails hard
(defclass promise ()
View
2 memoize.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
(defun memoize? (promise label)
"Create identical, but memoized, parser promise."
View
2 package.lisp
@@ -1,4 +1,4 @@
-(defpackage :parser-combinator
+(defpackage :parser-combinators
(:use :cl :iterate :alexandria :bpm)
(:export #:def-cached-parser
#:def-memo1-parser
View
4 parser-combinator-tests.asd
@@ -1,10 +1,10 @@
-(asdf:defsystem parser-combinator-tests
+(asdf:defsystem parser-combinators-tests
:version "0"
:description "Test for parser combinator library"
:maintainer "Jakub Higersberger <ramarren@gmail.com>"
:author "Jakub Higersberger <ramarren@gmail.com>"
:licence "BSD-style"
- :depends-on (:stefil :iterate :alexandria :parser-combinator :infix)
+ :depends-on (:stefil :iterate :alexandria :parser-combinators :infix)
:components ((:file "test-root")
(:file "test-parsers" :depends-on ("test-root"))
(:file "test-arithmetic" :depends-on ("test-root"))))
View
2 parser-combinator.asd
@@ -1,4 +1,4 @@
-(asdf:defsystem parser-combinator
+(asdf:defsystem parser-combinators
:version "0"
:description "Toy implementation of parser combinators"
:maintainer "Jakub Higersberger <ramarren@gmail.com>"
View
2 parsers.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
(def-memo1-parser char? character
"Parser: accept token eql to argument"
View
2 primitives.lisp
@@ -1,4 +1,4 @@
-(in-package :parser-combinator)
+(in-package :parser-combinators)
;;; macros for defining parsers
View
4 test-arithmetic.lisp
@@ -1,6 +1,6 @@
-(in-package :parser-combinator-tests)
+(in-package :parser-combinators-tests)
-(in-suite parser-combinator-tests)
+(in-suite parser-combinators-tests)
(defsuite* arithmetic-test)
View
4 test-parsers.lisp
@@ -1,6 +1,6 @@
-(in-package :parser-combinator-tests)
+(in-package :parser-combinators-tests)
-(in-suite parser-combinator-tests)
+(in-suite parser-combinators-tests)
(defsuite* parsers-tests)
View
6 test-root.lisp
@@ -1,7 +1,7 @@
-(defpackage :parser-combinator-tests (:use :cl :stefil :iterate :parser-combinator :alexandria :bpm))
+(defpackage :parser-combinators-tests (:use :cl :stefil :iterate :parser-combinators :alexandria :bpm))
-(in-package :parser-combinator-tests)
+(in-package :parser-combinators-tests)
(in-root-suite)
-(defsuite parser-combinator-tests)
+(defsuite parser-combinators-tests)

0 comments on commit f5e912f

Please sign in to comment.