Title :
Recursive descent techniques for ASN.1 decoding and encoding
Author_Institution :
Sch. of Math.-Phys.-Comput.-Electron., Macquarie Univ., NSW, Australia
Abstract :
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
Keywords :
decoding; encoding; grammars; program compilers; software engineering; software prototyping; ASN.1 decoding; Abstract Syntax Notation One; LEX; LL(1) compiler; YACC; compiler theory; compilers; encoding; generic decoder; lists; parser tables; rapid prototyping; recursive descent techniques; software engineering; state transition diagrams; Application software; Australia; Computer architecture; Decoding; Encoding; Mathematics; Physics computing; Protocols; Prototypes; Software engineering;
Conference_Titel :
TENCON '92. ''Technology Enabling Tomorrow : Computers, Communications and Automation towards the 21st Century.' 1992 IEEE Region 10 International Conference.
Conference_Location :
Melbourne, Vic.
Print_ISBN :
0-7803-0849-2
DOI :
10.1109/TENCON.1992.271930
