Abstract
In the next chapter we discuss computer languages in a more theoretical way, but here we will consider a concrete case—the matrix expressions mentioned in Chapter 1. This example is a relatively simple domain-specific language, but parsing matrix expressions, optimizing them, and then evaluating them are all the phases we usually have to implement in any DSL, and the implementation will also have examples of most of the techniques we will cover in more detail later.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Thomas Mailund
About this chapter
Cite this chapter
Mailund, T. (2018). Matrix Expressions. In: Domain-Specific Languages in R. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3588-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3588-1_2
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3587-4
Online ISBN: 978-1-4842-3588-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)