This brief paper describes a technique for processing variable length abbreviations using a modified tree structure approach. An implementation of the algorithm in Pascal is included. The paper is easy to read, presents the material in a straightforward manner, and is appropriate for someone interested in the general area of lexical processing.