M
Markos Charatzas
Hi all,
I'm trying to parse the following expression but i'm having difficulties
understanding the whole "parse a String" theory.
The string starts like this
XXX XXX 00-00-00000000000:0000:00XXXX X000 X
and then continues 'n' times
either in the same form as before
XXX XXX 00-00-00000000000:0000:00XXXX X000 X
or
00-00-00000000000:0000:00XXXX X000 X
Where 0 a digit and X a character.
I have this idea of checking the first 10 bytes of each string to see
whether or not they represent a character.
If yes then I link the current 'XXX XXX ' with the remaining string,
If not then I link the last 'XXX XXX ' with the remaining string.
but i've having trouble implementing it
Thanx in advance for ur responses.
I'm trying to parse the following expression but i'm having difficulties
understanding the whole "parse a String" theory.
The string starts like this
XXX XXX 00-00-00000000000:0000:00XXXX X000 X
and then continues 'n' times
either in the same form as before
XXX XXX 00-00-00000000000:0000:00XXXX X000 X
or
00-00-00000000000:0000:00XXXX X000 X
Where 0 a digit and X a character.
I have this idea of checking the first 10 bytes of each string to see
whether or not they represent a character.
If yes then I link the current 'XXX XXX ' with the remaining string,
If not then I link the last 'XXX XXX ' with the remaining string.
but i've having trouble implementing it
Thanx in advance for ur responses.