1

I am developing a new language and I am following a traditional approach: so there is a lexer, a parser, an ast and a virtual machine that executes bytecode.

When the parser encounters an operator like + then it produces an ADD virtual machine instruction and everything works as expected so far.

I would be interested in give a way to end user to extends the language, so for example the user could add an operator++ function in order to create its own post increment operator. I am not sure about the right way to proceed because the parser cannot know in advance all the operators the user could add so I am asking about what is the right approach to follow.

Seki
  • 11,135
  • 7
  • 46
  • 70
Marco
  • 783
  • 5
  • 21
  • Essentially operator overloading turns operators into function calls, but very few languages allow the addition of new operators due to the exact problem you state; even C++, known for it's "Kitchen sink included" philosophy, only allows certain existing operators to be overloaded, and their parsing behavior can't be changed. – bcrist Nov 13 '14 at 18:29
  • I'm very fond of Scala's approach where all methods are operators and vice versa. – lmm Nov 19 '14 at 18:00

3 Answers3

1

You could do it the Swift way: have operator declarations in your grammar

In Swift it looks like:

infix operator SomeToken { associativity left precedence 150 }

This tells the Swift parser that SomeToken will be a left-associative, infix operator, and that in any precedence-based decision, this operator's weight is 150. other operators will have higher, lower, or equal precedence metrics, and that will guide the parser in creating the AST

Enrico Granata
  • 3,303
  • 18
  • 25
0

For example in C# the list of operators that can be overloaded is known upfront and the overloading is always indicated by using a special keyword operator so it is known already to the parser that user is "adding" an operator.
See http://msdn.microsoft.com/en-us/library/aa691324(v=vs.71).aspx

For example in Prolog new operators and their evaluation priorities can be added to the language on-the-fly using the op(Precedence,Type,Name) directive. The Prolog parser reads and evaluates the input line by line. Each "line" is terminated with .
See http://www.learnprolognow.org/lpnpage.php?pagetype=html&pageid=lpn-htmlse40

xmojmr
  • 8,073
  • 5
  • 31
  • 54
0

One way to make your language infinitely extensible is to allow a full, reflexive metaprogramming, like in Common Lisp or Forth. This way user will be able to build any number of additional transforms on top of the existing core language, reusing everything already available in the language, including all the previous extensions, to implement such transforms.

If you want to be able to extend syntax, not just semantics, you may want to consider getting rid of your lexer and use a powerful lexerless parsing approach instead, namely, PEGs. Some languages are already doing this (Katahdin, pfront, CLike).

SK-logic
  • 9,605
  • 1
  • 23
  • 35