Talk:Recursive descent parser generator: Difference between revisions
Talk:Recursive descent parser generator (view source)
Revision as of 20:40, 13 December 2019
, 4 years ago→Input specification
No edit summary |
|||
| (4 intermediate revisions by 3 users not shown) | |||
Line 29:
[[User:MagiMaster|MagiMaster]] ([[User talk:MagiMaster|talk]]) 06:10, 2 April 2014 (UTC)
:I think I'd give some input samples and describe the characteristics of the output. Then I'd provide a sample implementation. If people have questions or whatever that will show up soon enough. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 06:53, 2 April 2014 (UTC)
::''I want to make it detailed enough to be at least slightly usable''
:The above can work ''against'' making a good RC task sometimes. You really don't want to make things too long. You also want to make a task in which the examples generated are comparable. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:12, 2 April 2014 (UTC)
::I think if it can handle the above example, it'd be enough. [[User:MagiMaster|MagiMaster]] ([[User talk:MagiMaster|talk]]) 16:49, 2 April 2014 (UTC)
::: For what it's worth: the implementation I provided handles the example, but uses the same precedence for multiplication and addition. I would not have had to do it that way, but was hoping for more examples before I added the line(s) precedence handling would require. (The trick is that the parser resolves from right to left, so it's result happens to coincide with the result you would get from a left to right parser with multiplication having a tighter precedence than addition or subtraction.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 18:38, 13 December 2019 (UTC)
| |||