|
|
|
Use this tool to learn about websites, specifically the one you just entered. If you find some aspect of it inappropriate it is not our fault. If you are the owner of this website: yes we are a real search engine, we do have a real web crawler called FyberSpider and you can block it if you feel the urge.
We are in the process of updating this tool. Until we are done just use our search results to check the inclusion status of your site. Visit this website or continue reading for info about this site saved by the FyberSearch web crawler FyberSpider.
June 26th, 2008 at 12:02pm
Date: Thu, 26 Jun 2008 16:56:53 GMT Server: Apache Last-Modified: Sun, 22 Jun 2008 17:42:48 GMT ETag: "50a97a-37c3-485e8f18" Accept-Ranges: bytes Content-Length: 14275 Connection: close Content-Type: text/html
The SLK Parser Generator supports C, C++, Java, and C#, and has optional backtracking
This is just a sample of the content found on this website. Please visit the website to read the entire page. " Home FAQ Documentation Download Contact The SLK Parser Generator SLK is the only LL(k) parser generator available. All others that claim to be LL(k) are not really LL(k) by any of the classical definitions of LL(k) found in the literature. SLK does a full LL(k) analysis of the grammar. The proprietary SLK algorithm is the only known near-solution to this NP-complete problem. Other deterministic algorithms must either limit k to a very small value, usually two, or use approximate lookahead methods that are very weak imitations of LL(k). SLK implements two new LL(k) algorithms that are not available in any other parser generator. SLK produces parsers that are nearly the fastest and most compact that is possible. The SLK parser generator produces fully modular parsers. SLK currently supports the C, C++, Java, and C# languages. The SLK parser specification language, the grammar, is completely programming language independent. SLK introduced a new and more precise action placement syntax for EBNF notation. SLK supports a new white space delimited syntax that accepts grammars in the forms commonly found in published reference grammars. SLK parsers have no library dependencies, so they are well-suited to embedded applications. SLK includes automated grammar transformation options that convert reference grammars to top-down format. Predictive backtracking can be enabled under programmer control as part of the syntax of the SLK parser generator. The SLK parsers are reentrant and thread-safe. Any number of SLK parsers for different grammars can be contained in a single program. Compiling SLK parsers is never a problem. All C, C++, Java and C# compilers are fully supported." .... read entire page
http://home.earthlink.net/~slkpg/slkimage.png
|
|
|