concept Parser combinator in category dsl

This is an excerpt from Manning's book DSLs in Action.
With basic background information about external DSL implementations already served up in chapter 7, we’re going to jump directly into parser combinators. Parser combinators are one of the most beautiful applications of functional programming. They offer an internal DSL to use for designing external DSLs so you don’t have to implement your own language infrastructure as you do with other techniques of external DSL design. When we designed an external DSL for processing client orders in chapter 7, remember that we used ANTLR as the parser generator. We designed our grammar for the DSL and ANTLR generated the parser for us. To design our own DSL, we had to use an external tool that provided us with the necessary language implementation infrastructure. Using parser combinators, you don’t have to step out of the host language for a second. This makes the implementation succinct, expressive, and completely free of any external dependency.
Parser combinators let you develop the syntax of your DSL in a declarative way, similar to writing EBNF rules. You can write EBNF-like declarative grammar rules in parser generators too, but when you use parser combinators, you remain within the scope of your host language and get to use all its other features. With support from the host language, you can decouple your semantic actions from the grammar and get a clean implementation of the DSL.