mirror of
https://github.com/sigmasternchen/php-doc-en
synced 2025-03-16 00:48:54 +00:00
Fix wording in introduction
git-svn-id: https://svn.php.net/repository/phpdoc/en/trunk@343145 c90b9560-bf6c-de11-be94-00142212c4b1
This commit is contained in:
parent
596b022270
commit
d274495473
1 changed files with 1 additions and 1 deletions
|
@ -17,7 +17,7 @@
|
|||
Lexer analysis is a process of splitting a character sequence into a list of lexemes. The lexeme list can be then used for the syntax analysis against a formal grammar. These operations are also known as lexing and parsing. This documentation doesn't aim to provide an exhaustive information on lexing and parsing. The basics can be found on the numerous resources on the net. Several usage examples are included, to show the functionality. The extension is also useful for PHP programmers willing to utilize parsing and lexing, while not having to implement own state machine and grammar handling, as this complex tasks are taken away by parle.
|
||||
</para>
|
||||
<para>
|
||||
The approach of the underlaying libraries used in parle is in most cases compatible to Flex, Bison and other similar tools. The substantial difference from the aforementioned tools is, that lexers and parsers are produced at the runtime and can be used immediately. Thanks to the underlying libraries, the underlaying work is still done by the parle extension, thus allowing for good efficiency. When the case complexity is irreducible with PCRE, parle sure comes into the game to handle sophisticated data structures. Nevertheless, in many cases there can be also a win for the cases even with the smaller complexity in terms or memory usage and maintainability.
|
||||
The approach of the underlaying libraries used in parle is in most cases compatible to Flex, Bison and other similar tools. The substantial difference from the aforementioned tools is, that lexers and parsers are produced at the runtime and can be used immediately. The corrsponding work is still done by the parle extension, thus allowing for good efficiency. When the case complexity is irreducible with PCRE, parle sure comes into the game to handle sophisticated data structures. Nevertheless, in many cases there can be also a win for the cases even with the smaller complexity in terms or memory usage and maintainability.
|
||||
</para>
|
||||
</preface>
|
||||
|
||||
|
|
Loading…
Reference in a new issue