Concept:Acceptor
== Headline ==
A program that accepts input according to some formal definition
== Details ==
For instance, we may implement a [[context-free grammar]] for [[parsing]], e.g., as a [[recursive descent parser]] without adding any semantic
actions, though, and thereby obtain an acceptor for the language generated by the grammar. The acceptor behaves essentially as a predicate on given
input: accept (true) or reject (false).
== Illustration ==
See [[Technology:Parsec]] for (the illustration of) a [[combinator library]] for parsing (or "accepting").
See [[Contribution:haskellAcceptor]] for a contribution with a [[Language:Haskell]]-based acceptor.
== Relationship ==
* An acceptor is "degenerated" [[parser]]. (No parse trees are synthesized.)
== Metadata ==
* [[relatesTo::http://en.wikipedia.org/wiki/Recognizer#Acceptors_and_recognizers]]