Re: Best language for implementing compilers?

Kaz Kylheku wrote:
-------------------------------------------------
Suppose we want to check whether we have an expression that is the binary
product of two binary sums, as in (* (+ a b) (+ c d)).


Without pattern matching:


  (when (and (eq (car expr) '*) ;; starts with *
                        (consp (cdr expr)) ;; has an argument
                        (consp (cddr expr)) ;; has another argument
                        (null (cdddr expr)) ;; then the list ends
                        (consp (cadr expr)) ;; first arg is a compound
                        (eq (cadr expr) '+) ;; ... starting with a +
                        ... ;; etc
      (do-whatever ...))


With very rudimentary pattern matching (simple destructuring):


  (destructuring-when (op1 (op2 a b) (op3 c d)) expr
      (when (equal (list op1 op2 op3) '(* + +))
          (do-whatever ...)))


With pattern matching:


  (when-match expr (* (+ ?a ?b) (+ ?c ?d))
      (do-whatever ...) ;; ?a ?b ... are in scope bound to subtrees
      ...)
-------------------------------------------------
Wow!


That is a fantastic example.


Are there programming languages that have the pattern matching capability
shown in Kaz's last example?


What programming language has the best pattern matching capability?


Is the programming language with the best pattern matching capability the best
language for implementing compilers?


/Roger
[Why do you think we're talking about ML? It has matching as a
primitive. I don't recall any lisp-ish languages with built in tree
matchers but it's easy enough to do that it's often an exercise in the
introductory programming class. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.