![]() ![]() ![]() ![]() In short, it will implicitly choose which side wins. If two of your conflicting rules are able to parse the same input, the left one in left / right will win (where / is a left-biased choice operator). If your grammar has non-trivial left-recursive parts you’ll spend a lot of time rearranging them. The methods of descent are the easier ones, but they have problems: Recursive descent: LL (including parser combinators/packrat), PEG.There are two major groups of parsing methods: And one of the first parts will most probably be a parser. Sooner or later, you’ll try to write yourself a programming language. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |