WebSVN – tendra.SVN – Diff – /branches/tendra5/src/utilities/calculus/lex.c

+/*
+ * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 3. Neither the name of The TenDRA Project nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific, prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
+ * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
+ * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * $Id$
+ */
 /*
     		 Crown Copyright (c) 1997
     This TenDRA(r) Computer Program is subject to Copyright
     owned by the United Kingdom Secretary of State for Defence
     acting through the Defence Evaluation and Research Agency
     (DERA).  It is made available to Recipients with a
     royalty-free licence for its use, reproduction, transfer
     to other parties and amendment for any purpose not excluding
     product development provided that any such use et cetera
     shall be deemed to be acceptance of the following conditions:-
         (1) Its Recipients shall ensure that this Notice is
         reproduced upon any copies or amended versions of it;
         (2) Any amended version of it shall be clearly marked to
         show both the nature of and the organisation responsible
         for the relevant amendment or amendments;
         (3) Its onward transfer from a recipient to another
         party shall be deemed to be that party's acceptance of
         these conditions;
         (4) DERA gives no warranty or assurance as to its
         quality or suitability for any purpose and DERA accepts
         no liability whatsoever in relation to any use to which
         it may be put.
 */
 #include "error.h"
 #include "lex.h"
 #include "syntax.h"
 #include "xalloc.h"
 /*
-    GET THE NEXT CHARACTER
+ * GET THE NEXT CHARACTER
+ *
+ * This routine reads the next character, either from the pending buffer
+ * or from the input file.
+ */
-    This routine reads the next character, either from the pending buffer
-    or from the input file.
-*/
-static int read_char
+static int
-    PROTO_Z ()
+read_char(void)
+{
-    int c ;
+    int c;
-    if ( pending != pending_buff ) {
+    if (pending != pending_buff) {
-	c = *( pending-- ) ;
+	c = *(pending--);
     } else {
-	c = fgetc ( lex_input ) ;
+	c = fgetc(lex_input);
-	if ( c == '\n' ) crt_line_no++ ;
+	if (c == '\n')crt_line_no++;
-	if ( c == EOF ) return ( LEX_EOF ) ;
+	if (c == EOF) return(LEX_EOF);
-	c &= 0xff ;
+	c &= 0xff;
     }
-    return ( c ) ;
+    return(c);
 }
 /*
-    TOKEN BUFFER
+ * TOKEN BUFFER
+ *
-    This buffer is used by read_token to hold the values of identifiers
+ * This buffer is used by read_token to hold the values of identifiers
-    and strings.  The variable token_value is also used to hold the
+ * and strings.  The variable token_value is also used to hold the
-    values of numbers.
+ * values of numbers.
-*/
+ */
-char token_buff [2000] ;
+char token_buff[2000];
-static char *token_end = token_buff + sizeof ( token_buff ) ;
+static char *token_end = token_buff + sizeof(token_buff);
-char *first_comment = NULL ;
+char *first_comment = NULL;
-number token_value ;
+number token_value;
 /*
-    READ AN IDENTIFIER
+ * READ AN IDENTIFIER
+ *
-    This routine reads an identifier beginning with a, returning the
+ * This routine reads an identifier beginning with a, returning the
-    corresponding lexical token.  Keywords are dealt with locally.
+ * corresponding lexical token.  Keywords are dealt with locally.
-*/
+ */
-static int read_identifier
+static int
-    PROTO_N ( ( a ) )
-    PROTO_T ( int a )
+read_identifier(int a)
 {
-    int c = a, cl ;
+    int c = a, cl;
-    char *t = token_buff ;
+    char *t = token_buff;
     do {
-	*( t++ ) = ( char ) c ;
+	*(t++) = (char)c;
+	if (t == token_end) {
-	if ( t == token_end ) error ( ERROR_FATAL, "Buffer overflow" ) ;
+		error(ERROR_FATAL, "Buffer overflow");
+	}
-	c = read_char () ;
+	c = read_char();
-	cl = lookup_char ( c ) ;
+	cl = lookup_char(c);
-    } while ( is_alphanum ( cl ) ) ;
+    } while (is_alphanum(cl));
-    *t = 0 ;
+    *t = 0;
-    unread_char ( c ) ;
+    unread_char(c);
     /* Check for keywords */
-    t = token_buff ;
+    t = token_buff;
-#define MAKE_KEYWORD( A, B )\
+#define MAKE_KEYWORD(A, B)\
-    if ( streq ( t, ( A ) ) ) return ( B ) ;
+    if (streq(t,(A))) return(B);
 #include "keyword.h"
-    return ( lex_identifier ) ;
+    return(lex_identifier);
+}
 /*
-    READ A NUMBER
+ * READ A NUMBER
-    This routine reads a number beginning with a, returning the
-    corresponding lexical token.  The actual value of the number is built
-    up in token_value.
-*/
-static int read_number
-    PROTO_N ( ( a ) )
-    PROTO_T ( int a )
-{
-    int c = a, cl ;
-    number n = 0 ;
-    do {
-	n = 10 * n + ( number ) ( c - '0' ) ;
-	c = read_char () ;
-	cl = lookup_char ( c ) ;
-    } while ( is_digit ( cl ) ) ;
-    unread_char ( c ) ;
-    token_value = n ;
-    return ( lex_number ) ;
-}
-/*
+ *
-    READ A HEXADECIMAL NUMBER
-    This routine reads a hexadecimal number beginning with a, returning the
+ * This routine reads a number beginning with a, returning the
-    corresponding lexical token.  The actual value of the number is built
+ * corresponding lexical token.  The actual value of the number is built
-    up in token_value.
+ * up in token_value.
-*/
+ */
-static int read_hex
+static int
-    PROTO_N ( ( a ) )
-    PROTO_T ( int a )
+read_number(int a)
+{
-    int c = a, cl ;
+    int c = a, cl;
-    number n = 0 ;
+    number n = 0;
     do {
-	number d ;
-	if ( c >= '0' && c <= '9' ) {
-	    d = ( number  ) ( c - '0' ) ;
+	n = 10 * n + (number)(c - '0');
-	} else if ( c >= 'A' && c <= 'Z' ) {
-	    d = ( number ) ( c - 'A' ) + 10 ;
-	} else {
-	    d = ( number ) ( c - 'a' ) + 10 ;
-	}
-	n = 16 * n + d ;
-	c = read_char () ;
+	c = read_char();
-	cl = lookup_char ( c ) ;
+	cl = lookup_char(c);
-    } while ( is_hexdigit ( cl ) ) ;
+    } while (is_digit(cl));
-    unread_char ( c ) ;
+    unread_char(c);
-    token_value = n ;
+    token_value = n;
-    return ( lex_number ) ;
+    return(lex_number);
 }
 /*
-    READ A STRING
+ * READ A HEXADECIMAL NUMBER
+ *
-    This routine reads a string.  It is entered after the initial
+ * This routine reads a hexadecimal number beginning with a, returning the
-    quote has been read.  Note that there are no escape sequences.
+ * corresponding lexical token.  The actual value of the number is built
+ * up in token_value.
-*/
+ */
-static int read_string
+static int
-    PROTO_Z ()
+read_hex(int a)
 {
-    int c ;
+    int c = a, cl;
-    char *t = token_buff ;
+    number n = 0;
+    do {
+	number d;
-    while ( c = read_char (), c != '"' ) {
+	if (c >= '0' && c <= '9') {
+	    d = (number )(c - '0');
-	if ( c == '\n' || c == LEX_EOF ) {
+	} else if (c >= 'A' && c <= 'Z') {
-	    error ( ERROR_SERIOUS, "Unexpected end of string" ) ;
+	    d = (number)(c - 'A') + 10;
-	    break ;
+	} else {
+	    d = (number)(c - 'a') + 10;
 	}
+	n = 16 * n + d;
+	c = read_char();
-	*( t++ ) = ( char ) c ;
+	cl = lookup_char(c);
-	if ( t == token_end ) error ( ERROR_FATAL, "Buffer overflow" ) ;
+    } while (is_hexdigit(cl));
-    }
+    unread_char(c);
-    *t = 0 ;
+    token_value = n;
-    return ( lex_string ) ;
+    return(lex_number);
 }
 /*
-    READ A COMMENT
+ * READ A STRING
+ *
+ * This routine reads a string.  It is entered after the initial
+ * quote has been read.  Note that there are no escape sequences.
+ */
-    This routine reads a C style comment, returning the lexical token
-    immediately following.  It is entered after the first two characters
-    have been read.
-*/
-static int read_comment
+static int
-    PROTO_Z ()
+read_string(void)
+{
-    int state = 0 ;
+    int c;
-    char *t = token_buff ;
+    char *t = token_buff;
-    *( t++ ) = '/' ;
-    *( t++ ) = '*' ;
-    while ( state != 2 ) {
+    while (c = read_char(), c != '"') {
-	int c = read_char () ;
-	if ( c == LEX_EOF ) {
+	if (c == '\n' || c == LEX_EOF) {
-	    error ( ERROR_SERIOUS, "End of file in comment" ) ;
+	    error(ERROR_SERIOUS, "Unexpected end of string");
-	    return ( lex_eof ) ;
+	    break;
+	}
+	*(t++) = (char)c;
+	if (t == token_end) {
+		error(ERROR_FATAL, "Buffer overflow");
+	}
+    }
+    *t = 0;
+    return(lex_string);
+}
+/*
+ * READ A COMMENT
+ *
+ * This routine reads a C style comment, returning the lexical token
+ * immediately following.  It is entered after the first two characters
+ * have been read.
+ */
+static int
+read_comment(void)
+{
+    int state = 0;
+    char *t = token_buff;
+    *(t++) = '/';
+    *(t++) = '*';
+    while (state != 2) {
+	int c = read_char();
+	if (c == LEX_EOF) {
+	    error(ERROR_SERIOUS, "End of file in comment");
+	    return(lex_eof);
+	}
-	if ( c == '*' ) {
+	if (c == '*') {
-	    state = 1 ;
+	    state = 1;
-	} else if ( state == 1 && c == '/' ) {
+	} else if (state == 1 && c == '/') {
-	    state = 2 ;
+	    state = 2;
 	} else {
-	    state = 0 ;
+	    state = 0;
+	}
+	*(t++) = (char)c;
+	if (t == token_end) {
+		t = token_buff + 2;
+	}
-	*( t++ ) = ( char ) c ;
-	if ( t == token_end ) t = token_buff + 2 ;
+    }
-    *t = 0 ;
+    *t = 0;
+    if (first_comment == NULL) {
-    if ( first_comment == NULL ) first_comment = xstrcpy ( token_buff ) ;
+	    first_comment = xstrcpy(token_buff);
+    }
-    return ( read_token () ) ;
+    return(read_token());
+}
 /*
-    CURRENT TOKEN
+ * CURRENT TOKEN
+ *
-    These variables are used by the parser to hold the current and former
+ * These variables are used by the parser to hold the current and former
-    lexical tokens.
+ * lexical tokens.
-*/
+ */
-int crt_lex_token ;
+int crt_lex_token;
-int saved_lex_token ;
+int saved_lex_token;
 /*
-    PROCESS FILE
+ * PROCESS FILE
+ *
-    This routine processes the input file nm.  If r is true then it is
+ * This routine processes the input file nm.  If r is true then it is
-    processed using read_calculus, otherwise extra_calculus is used.
+ * processed using read_calculus, otherwise extra_calculus is used.
-*/
+ */
-void process_file
+void
-    PROTO_N ( ( nm, r ) )
-    PROTO_T ( char *nm X int r )
+process_file(char *nm, int r)
+{
-    crt_line_no = 1 ;
+    crt_line_no = 1;
-    crt_file_name = nm ;
+    crt_file_name = nm;
-    lex_input = fopen ( nm, "r" ) ;
+    lex_input = fopen(nm, "r");
-    if ( lex_input == NULL ) {
+    if (lex_input == NULL) {
-	error ( ERROR_SERIOUS, "Can't open input file, '%s'", nm ) ;
+	error(ERROR_SERIOUS, "Can't open input file, '%s'", nm);
-	return ;
+	return;
+    }
-    ADVANCE_LEXER ;
+    ADVANCE_LEXER;
-    if ( r ) {
+    if (r) {
-	read_calculus () ;
+	read_calculus();
     } else {
-	extra_calculus () ;
+	extra_calculus();
+    }
-    if ( crt_lex_token != lex_eof ) {
+    if (crt_lex_token != lex_eof) {
-	error ( ERROR_SERIOUS, "Terminating due to syntax error" ) ;
+	error(ERROR_SERIOUS, "Terminating due to syntax error");
+    }
-    fclose_v ( lex_input ) ;
+    fclose_v(lex_input);
-    return ;
+    return;
+}

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/utilities/calculus/lex.c – Rev 5 → 6