Talk:Parsing
From Wikipedia, the free encyclopedia
Lexing does not necessarily use regular expressions. Infact that's a rather messed up way of doing it.
Contents |
[edit] parseable vs parsable
It seemed to me that the word should be spelled "parsable" following the pattern of elapse/elapsable and traverse/traversable. However, unlike those words a Google search shows fairly even balance between parseable (338,000 hits) and parsable (281,000 hits). Can anyone explain why this word would be treated specially by English speakers? Is it because parse only has one syllable, i.e. so few letters are left after dropping the "e" that people are worried it might be confused with some other root?
[edit] push-me-pull-you
I came here looking for an explanation of push- and pull- parsing. If anybody would like to contribute such a section or page, I for one would appreciate it. Thanks.
I wouldn't call myself an expert, so I won't put this into the page, but IIRC 'push' and 'pull' parsers relate more to the nature of the API they use to interface to the program. You can 'push' tokens into it and the parser triggers callbacks, or the parser just runs on the entire text and you 'pull' out parsed events.
[edit] Parsing in regards to human language?
I know that nowadays everybody talks about parsing in regards to computer languages, but there really ought to be something in there about ordinary parsing of ordinary languages. Or do you young kids not talk about that stuff anymore? 203.26.16.68 07:25, 20 November 2006 (UTC)
[edit] Appropriateness of UCalc link
The link to UCalc's commercial maths parsing software for Windows seems a little inappropriate here for two reasons. Firstly it is a mathematics parser whereas the article is on parsing in general, and secondly there are numerous platform-independent freeware alternatives such as http://www.codeproject.com/cpp/FastMathParser.asp - which might be more suitable if a link to a mathematics parser is indeed appropriate here. Any thoughts? Chrisjohnson 22:22, 10 March 2007 (UTC)
