Fix broken links to R4RS and SICP
This commit is contained in:
		
							parent
							
								
									243e4c528b
								
							
						
					
					
						commit
						7583c9719e
					
				| 
						 | 
				
			
			@ -9,7 +9,7 @@ by David Joseph Stith
 | 
			
		|||
<hr>
 | 
			
		||||
<b>Welcome to the home of my Scheme interpreter/compiler, 'dream', written in x86 machine language. :-)</b>
 | 
			
		||||
<br />
 | 
			
		||||
All essential syntax and procedures from the <a href="http://www.swiss.ai.mit.edu/~jaffer/r4rs_toc.html">R4RS standard</a> are implemented.
 | 
			
		||||
All essential syntax and procedures from the <a href="https://people.csail.mit.edu/jaffer/r4rs_toc.html">R4RS standard</a> are implemented.
 | 
			
		||||
<br />
 | 
			
		||||
The interpreter is properly tail recursive and passes all applicable tests from the 'r4rstest.scm' test suite.
 | 
			
		||||
<br />
 | 
			
		||||
| 
						 | 
				
			
			@ -39,7 +39,7 @@ Interpreter as a bootable floppy disk:</b> <a href="dreamos.html">dreamos</a>
 | 
			
		|||
<hr>
 | 
			
		||||
<h2>Notes on the Design</h2>
 | 
			
		||||
<p>
 | 
			
		||||
The design for the 'dream' Scheme interpreter began with the design given in Abelson and Sussman's <a href="http://mitpress.mit.edu/sicp/full-text/book/book.html">Structure and Interpretation of Computer Programs</a>.
 | 
			
		||||
The design for the 'dream' Scheme interpreter began with the design given in Abelson and Sussman's <a href="https://go.scheme.org/sicp">Structure and Interpretation of Computer Programs</a>.
 | 
			
		||||
</p>
 | 
			
		||||
<p>In the following I will use the term 'byte' to refer to 8 bits, 'wyde' to refer to two bytes, 'tetra' to refer to four bytes, and 'octa' to refer to eight bytes.</p>
 | 
			
		||||
<h2>Garbage Collection</h2>
 | 
			
		||||
| 
						 | 
				
			
			@ -136,7 +136,7 @@ Consequently when call-with-current-continuation is invoked, this native stack i
 | 
			
		|||
</p>
 | 
			
		||||
<h2>Scheme Registers</h2>
 | 
			
		||||
<p>
 | 
			
		||||
The registers denoted by EXP, ENV, UNEV, ARGL, VAL, and FREE in <a href="http://mitpress.mit.edu/sicp/full-text/book/book.html">Structure and Interpretation of Computer Programs</a> are implemented by the machine registers EDX, EBP, ESI, EDI, EAX, and EBX respectively.
 | 
			
		||||
The registers denoted by EXP, ENV, UNEV, ARGL, VAL, and FREE in <a href="https://go.scheme.org/sicp">Structure and Interpretation of Computer Programs</a> are implemented by the machine registers EDX, EBP, ESI, EDI, EAX, and EBX respectively.
 | 
			
		||||
The registers EXP, ENV, UNEV, ARGL, and VAL must point to a valid scheme object (or be zero) when the garbage collector is invoked.
 | 
			
		||||
Likewise, the garbage collector registers OLD, NEW, and SCAN are implemented by the machine registers ESI, EDI, and EAX respectively.
 | 
			
		||||
<hr>
 | 
			
		||||
| 
						 | 
				
			
			
 | 
			
		|||
		Loading…
	
		Reference in New Issue