Pastable version of Super Simple Parser in Scheme

<pre class='prettyprint' language='lisp'>(define (remove-subnodes n L)
  (cond ((null? L) `())
	((= n (car L)) L)
	(else (remove-subnodes n (cdr L)))))

(define (subnode-of? n1 n2)
  (&lt; n1 n2))

(define (equal-nodes? n1 n2)
  (= n1 n2))

; Take a list of numbers and build a list 
; where subnodes are 1 less than thier parent
; nodes on the same level are equal. 
; 
; (build-list `(0 1 1 2 2 1 1 2 1 0)
; =&gt; (0 (1 1 (2 2) 1 1 (2) 1) 0)
;
; (build-list `(0 1 2 3 4 5 1 0))
; =&gt; (0 (1 (2 (3 (4 (5)))) 1) 0)
;
; (build-list `(1 2 1 2))
; =&gt; (1 (2) 1 (2))
;
(define (build-list L)
  (define (helper n L)
    (cond ((null? L) `())
	  ((subnode-of? n (car L))
           (cons (cons (car L) 
		       (helper (car L) (cdr L)))
		 (helper n (remove-subnoes n (cdr L)))))
	  ((equal-nodes? n (car L))
	   (cons (car L)
		 (helper (car L) (cdr L))))
	  (else `())))
  (cons (car L) (helper (car L) (cdr L))))</pre>
<a href="http://www.refactormycode.com/codes/486-super-simple-parser-in-scheme" style="color:#fff" title="As seen on RefactorMyCode.com"><img alt="Small_logo" src="http://www.refactormycode.com/images/small_logo.gif" style="border:0" /></a>

Refactor :my => 'code'

Recent

Popular

Pastable version of Super Simple Parser in Scheme