From: Ethan Dicks (ethan.dicks_at_gmail.com)
Date: 2008-06-17 12:49:56
On Tue, Jun 17, 2008 at 10:32 AM, Marko Mäkelä <msmakela@gmail.com> wrote:
> On Tue, Jun 17, 2008 at 03:58:55AM +0000, Ethan Dicks wrote:
>> Here's a first-cut sample of how something might look.
>>
>> <http://penguincentral.com/retrocomputing/PET/mmaps/PET-BASIC_2.0_zeropage.html>
>
> This looks like a very good start. If I were you, I would define the
> layout in CSS to make the table a little more compact.
Good idea. I don't fiddle with CSS much - I got my start with Netscape 0.9
back in 1995, so I tend to code manual HTML with very few modern features.
> The labels for
> hovering could include the address, because it is not obvious where the
> least significant digit is: in the column, or in the row.
I completely agree.
> (I'd make the
> MSB the columns, so that the table could be extended with more rows: $00
> to $3f to document the first kilobyte of memory, $000 to $3ff.)
Don't you mean MSB as the rows? As in...
00 01 02 03...
10 11 12 13...
20 21 22 21...
(which is what it is now)
> I made a quick sketch to give you the idea. Please see the attachment.
I see what you are going after, yes.
> It'd be very nice to define a title for every location, consisting of
> the address, a mnemonic name and a short description. Multi-byte ranges
> such as the tape buffer could repeat the same title in every cell,
> consisting of the address range, the mnemonic name of the start address,
> and the description.
Sure. Without annotation, it's interesting, but not as useful as it
would be with pop-up comments.
> I'd seriously consider generating the HTML from a Perl script that reads
> an ASCII memory map as an input. That would avoid errors in the
> addresses and also make it easy to edit the layout.
Indeed. I just banged something out to get it visible for discussion.
I am entirely in favor of code-generated pages like this.
Thanks for your input and your sample.
-ethan
Message was sent through the cbm-hackers mailing list
Archive generated by hypermail pre-2.1.8.