C Compiler errors

/* Define to prevent recursive inclusion -------------------------------------*/
#ifndef __BUFFERSTORE_H
#define __BUFFERSTORE_H

#define	NUMBEROFBUFFERS	20	

/*MultiBuffer Definition
 * This is the work horse of this program. it defines
 * storage for either data for processing, packet for
 * transmission or just received and also the raw data for
 * physical medium
 * These definition by using the union construct will allow
 * for easier data manipulation.
 */

typedef volatile union
{
	struct
	{
		/*	For data storage can be used for everything (TX or RX)	*/
		char processNumber;	/*	will probably id the task that needs the data	*/
		//char pNumberB;		/*	Packet number binary (one byte)	*/
		char dataSize;		/*	number of bytes(max 10)	*/
		char data[10];		/*	Data bytes	*/

	}dataS;	/*	Data structure	*/

	struct
	{
		/*	For Packet Storage can be used for RX or TX
			All values have been translated to Hex ASCII
			Hence the need for Two bytes in most cases.	*/
		char pStartChar;	//Start char normally (
		char pTypeChar;		//Packet Type 1 to F
		char pNumberH[2];	//packet number in Hex 00 to FF
		char pDSize[2];		//packet size in Hex 
		char pChecksum[2];	//packet checksum
		char pData[20];		//packet Data
		char pEndChar;		//End char normally )
		char pSize;
	}packetS;	// Packet structure
	
	struct
	{
		//for Packet Storage after Hex Ascii to binary conversion
		// may not be needed can be used for RX or TX
		//All values have been translated to Binary values
		char pStartChar;	//Start char normally (
		char pTypeChar;		//Packet Type 1 to F
		char pNumber;		//packet number in Hex 00 to 255
		char pDSize;		//packet size 
		char pChecksum;		//packet checksum 00 to FF
		char pData[10];		//packet Data
		char pEndChar;		//End char normally )
		
	//for raw hex data
	char rBuffer[30]; // this buffer is defined for ease of use by the UART
}MultiBuffer;

/* --------------------------------------------------------------------------- */


/* Queue Handling */

/*	The Element as two parts, the payload or data part
	and a pointer to the next Element, hence it can be used to
	implement a linked list. 									*/

typedef	volatile struct Element Element;	/*	This is required to let the compiler know
												that the struct Element is te same as the Element
												or it will generate an "incomplete" definition error. */

struct Element
{
	MultiBuffer *payload;
	volatile struct Element *nextElement;
};


/*	To implement a queue de only thing you need really is to know where the Head of 
	the Queue and its tail is. By then accessing the elements they will let you know 
	where the others are.																*/
volatile typedef struct
		{
			volatile Element *head;
			volatile Element *tail;
		}Queue;

/* ------------------------------------------------------------------------------------*/


volatile Queue *createQueue(void);
void createQueues(void);
volatile Queue *addElementToQueue(volatile Queue *queue, volatile MultiBuffer *bufferPrt);
volatile MultiBuffer *getElementFromQueue(volatile Queue *queue);
		
		
#endif /* __BUFFERSTORE_H */

/*	The Element as two parts, the payload or data part 	and a pointer to the next Element, hence it can be used to 	implement a linked list. 									*/  typedef	volatile struct Element Element;	/*	This is required to let the compiler know 												that the struct Element is the same as the Element 												or it will generate an "incomplete" definition error. */

struct Element 
{ 	MultiBuffer *payload;
 	volatile struct     Element *nextElement; 
};

#define NUMBEROFBUFFERS 20  

/*MultiBuffer Definition
 * This is the work horse of this program. it defines
 * storage for either data for processing, packet for
 * transmission or just received and also the raw data for
 * physical medium
 * These definition by using the union construct will allow
 * for easier data manipulation.
 */

typedef /*volatile*/ union
{
  struct
  {
    /*  For data storage can be used for everything (TX or RX)  */
    char processNumber; /*  will probably id the task that needs the data */
    //char pNumberB;    /*  Packet number binary (one byte) */
    char dataSize;    /*  number of bytes(max 10) */
    char data[10];    /*  Data bytes  */

  }dataS; /*  Data structure  */

  struct
  {
    /*  For Packet Storage can be used for RX or TX
      All values have been translated to Hex ASCII
      Hence the need for Two bytes in most cases. */
    char pStartChar;  //Start char normally (
    char pTypeChar;   //Packet Type 1 to F
    char pNumberH[2]; //packet number in Hex 00 to FF
    char pDSize[2];   //packet size in Hex 
    char pChecksum[2];  //packet checksum
    char pData[20];   //packet Data
    char pEndChar;    //End char normally )
    char pSize;
  }packetS; // Packet structure
  
  struct
  {
    //for Packet Storage after Hex Ascii to binary conversion
    // may not be needed can be used for RX or TX
    //All values have been translated to Binary values
    char pStartChar;  //Start char normally (
    char pTypeChar;   //Packet Type 1 to F
    char pNumber;   //packet number in Hex 00 to 255
    char pDSize;    //packet size 
    char pChecksum;   //packet checksum 00 to FF
    char pData[10];   //packet Data
    char pEndChar;    //End char normally )
    
    //for raw hex data
    char rBuffer[30]; // this buffer is defined for ease of use by the UART
  } foo;  //!! pick a name for this nested struct
}MultiBuffer;

/* --------------------------------------------------------------------------- */


/* Queue Handling */

/*  The Element as two parts, the payload or data part
  and a pointer to the next Element, hence it can be used to
  implement a linked list.                  */

#if 0
//!! serves no purpose.
//!! you probably added this to 'fix' the missing earlier brace.
typedef volatile struct Element Element;  /*  This is required to let the compiler know
                        that the struct Element is te same as the Element
                        or it will generate an "incomplete" definition error. */
#endif

struct Element
{
  MultiBuffer *payload;
  volatile struct Element *nextElement;
};


/*  To implement a queue de only thing you need really is to know where the Head of 
  the Queue and its tail is. By then accessing the elements they will let you know 
  where the others are.                               */
/*volatile*/ typedef struct
    {
      //!! you need struct Element here, because Element isn't typedef'ed
      volatile struct Element *head;
      volatile struct Element *tail;
    }Queue;

/* ------------------------------------------------------------------------------------*/


volatile Queue *createQueue(void);
void createQueues(void);
volatile Queue *addElementToQueue(volatile Queue *queue, volatile MultiBuffer *bufferPrt);
volatile MultiBuffer *getElementFromQueue(volatile Queue *queue);