Jump to content

Algebraic data types: Difference between revisions

→‎{{Header|E}}: Removed a superfluous comments : pattern factorisation is not unusual, OCaml does the same
(cuts away prolog version)
(→‎{{Header|E}}: Removed a superfluous comments : pattern factorisation is not unusual, OCaml does the same)
Line 12:
 
Both of those operators are defined in terms of the basic bind/match operation: <code>def <var>pattern</var> exit <var>failure_handler</var> := <var>specimen</var></code>
 
The scoping rules for E's <code>if</code> and <code>||</code> allow <code>balance</code> in this example to reuse the same output expression; this is unusual among pattern-matching systems.
 
def balance(tree) {
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.