| 1 | .TH STRINGS UCB 2/24/79 UCB |
| 2 | .SH NAME |
| 3 | strings \- find the printable strings in a object, or other binary, file |
| 4 | .SH SYNOPSIS |
| 5 | .B strings |
| 6 | [ |
| 7 | .B \- |
| 8 | ] [ |
| 9 | .B \-o |
| 10 | ] [ |
| 11 | \fB\-\fInumber\fR |
| 12 | ] file ... |
| 13 | .SH DESCRIPTION |
| 14 | .I Strings |
| 15 | looks for ascii strings in a binary file. |
| 16 | A string is any sequence of 4 or more printing characters ending with |
| 17 | a newline or a null. |
| 18 | Unless the |
| 19 | .B \- |
| 20 | flag is given, |
| 21 | .I strings |
| 22 | only looks in the initialized data space of object files. |
| 23 | If the |
| 24 | .B \-o |
| 25 | flag is given, then each string is preceded by its offset in the |
| 26 | file (in octal). |
| 27 | If the |
| 28 | \fB\-\fInumber\fR |
| 29 | flag is given then number is used as the minimum string length |
| 30 | rather than 4. |
| 31 | .PP |
| 32 | .I Strings |
| 33 | is useful for identifying random object files and many other things. |
| 34 | .SH "SEE ALSO" |
| 35 | od(1) |
| 36 | .SH AUTHOR |
| 37 | Bill Joy |
| 38 | .SH BUGS |
| 39 | The algorithm for identifying strings is extremely primitive |