thma/LtuPatternFactory
1
1
Fork 0
mirror of https://github.com/thma/LtuPatternFactory.git synced 2024-12-12 10:42:08 +03:00
Code Issues Projects Releases Wiki Activity

add quotation

Browse Source
This commit is contained in:
thma 2018-12-30 12:32:12 +01:00
parent f783d0ce09
commit 4c5492ede5
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -714,6 +714,10 @@ There are many predefined Monads available in the Haskell curated libraries and
### Interpreter → Reader Monad ### Interpreter → Reader Monad
> In computer programming, the interpreter pattern is a design pattern that specifies how to evaluate sentences in a language. The basic idea is to have a class for each symbol (terminal or nonterminal) in a specialized computer language. The syntax tree of a sentence in the language is an instance of the composite pattern and is used to evaluate (interpret) the sentence for a client.
>
> [Quoted from Wikipedia](https://en.wikipedia.org/wiki/Interpreter_pattern)
In the section [Singleton → Applicative](#singleton--applicative) we have already written a simple expression evaluator. From that section it should be obvious how easy the definition of evaluators and interpreters is in functional programming languages. In the section [Singleton → Applicative](#singleton--applicative) we have already written a simple expression evaluator. From that section it should be obvious how easy the definition of evaluators and interpreters is in functional programming languages.
The main ingredients are: The main ingredients are: