projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d90270a) | patch
When walking predicate nodes, must be able to handle case where either
authorChris Hanson <org/chris-hanson/cph>
Wed, 29 Jul 1987 02:16:52 +0000 (02:16 +0000)
committerChris Hanson <org/chris-hanson/cph>
Wed, 29 Jul 1987 02:16:52 +0000 (02:16 +0000)
commit71ca9ffa6d65aca48807025208f8f9bad20e073a
tree0eb74de1e8c222a064bd2b27db2f73bc5f3c9a9btree | snapshot
parentd90270a54b5a9140e4b0a9002416122ac864548ccommit | diff
When walking predicate nodes, must be able to handle case where either
the consequent or alternative is nonexistent.  This is because we must
walk over incomplete graphs when generating code for operands.
v7/src/compiler/rtlgen/rtlgen.scm diff | blob | history
MIT/GNU Scheme, Pucked