Chapter 8. An Expression Language
In this chapter we will implement a DSL for expressions, including arithmetic, boolean, and string expressions. We will do incrementally and in a test-driven way. Since expressions are by their own nature recursive, writing a grammar for this DSL requires some additional efforts, and this allows us to discover additional features of Xtext grammars.
You will also learn how to implement a type system for a DSL to check that expressions are correct with respect to types (for example, you cannot add an integer and a boolean). We will implement the type system so that it fits the Xtext framework and integrates correctly with the corresponding IDE tooling.
Finally, we will implement an interpreter for these expressions. ...
Get Implementing Domain-Specific Languages with Xtext and Xtend now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
