Is writing a compiler for a compact language easier?
-
04-11-2019 - |
Question
I am contemplating the project of writing a compiler. I am wondering if, aside from the availability of easy google results, it is easier to write a compiler for a more explicit/verbose language such as ada, compared to a very compact language such as APL, for example.
I should add that i am especially interested in whole-program optimization.
Edit: my question boils down to "do highly abstracted symbols/keywords (as in APL, where a single operator represents a function) make it easier to write a compiler, or is a language with a more traditional syntax (where a function includes a variety of operators) easier?"
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange