Recursive descent techniques for ASN.1 decoding and encoding

The design of Abstract Syntax Notation One (ASN.1) coders and compilers using recursive descent techniques from its theoretical basis in compiler theory to software engineering considerations is examined. LL(1) compiler theory is used to develop parser tables and state transition diagrams for recursive descent decoders. A generic decoder is developed which includes specific ANS.1 specification information in tables generated using YACC and LEX. The decoder requires small amounts of code and can be used for general ASN.1 syntax specifications without modification, making it suitable for rapid prototyping applications. The storage of data is achieved by means of lists rather than conventional programming structures.<
>