BST - object deck disassembler.

Syntax:

bst [routine]  [+Preface]

Examples:

bst
bst +p <r*
bst main >out
bst +Preface </mydeck >out

Options:

routine
is a SYMDEF. BST only dumps the deck containing that SYMDEF. The default is to dump all decks that are found in the file.
+Preface
displays preface card information.

Description:

BST tries to generate a GMAP-style LSTOU using an object deck as input. The file may contain several files, each separated by a logical end-of-file mark. On encountering a logical end-of-file mark, BST skips past the end of file to look for the next object deck only if the last DKEND card specified CONTINUE. Files left in "b*" are in this multi-file format.

BST displays any GCOS control cards imbedded in the object deck.

BST normally reads from the standard input and writes to the standard output. However, if the standard input is assigned to the terminal, BST tries to open and read from a file called "b*".

The output corresponds as closely as feasible to that of the GMAP assembler, but since information has been lost, exact agreement is not possible. The output uses a unary "+" to mark a numerical value that is to be relocated. Octal values are always six characters long, padded with preceding zeroes. When there is some doubt, values are given in decimal, since the octal is available in the display of the word being decoded.

If the routine to be examined is located in a random library, it should be "Extracted" using the RANEDIT command and then examined using BST.

Notes:

Because BST uses heuristics to decode information, certain instruction words may be incorrectly interpreted as ASCII.

BST cannot cope with an ALGOL or absolute object deck, mostly because BST cannot determine the size of the program element before reading the text cards. You can tell when BST has found an ALGOL deck because the program size is zero.

Copyright © 1996, Thinkage Ltd.