There seems to be a few ways around this issuie: 1. You could create a programming language where every keyword is a symbol: http://ccsenet.org/journal/index.p

There seems to be a few ways around this issuie: 1. You could create a programming language where every keyword is a symbol: http://ccsenet.org/journal/index.php/cis/article/view/23904 http://ccsenet.org/journal/index.php/cis/article/view/23904. This is what mathematics does. 2. You could also create a programming language where every reserved keyword is a special type and then expose that type to the programmer. Thereby allowing them to reuse that word just with a different type then the reserved keyword. This would come with a lot of complexity costs however because now you don't know if your generated AST is valid until the typechecker.