Has anybody tried to rewrite the whole XML EBNF grammar to LL(1) form? I try to write recursive descent parser...but i have some problems. Can anybody show me LL(1) grammar for XML, something like:
1.)element → [<] · name · attribute_list · element_suffix
2.) element_suffix → [/] · [>]
3.) element_suffix → [>] · element · [<] · [/] · [name] · [>]
4.) attribute_list → [space] · attribute_list_suffix
5.) attribute_list → ε
6.) attribute_list_suffix → attribute · attribute_list
7.) attribute → name · optional_space · [=] · optional_space · attribute_value
8.) attribute_value → ["] · [id] · ["]
9.) attribute_value → ['] · [id] · [']
10.) optional_space → [space]
11.) optional_space → ε
.
.
.
Thanks