Result for 00FD74BC9C226B9C20FF0AAFB2E1FE05B6242C64

Query result

Key Value
FileName./usr/share/doc/frown-doc/html/Manual.html
FileSize484035
MD5047494B4AC946DF7F0DC746CFE16552C
SHA-100FD74BC9C226B9C20FF0AAFB2E1FE05B6242C64
SHA-256A367CF175D9CF75C28C8F1BE55C3909B3A7E49D1221D630F98FFB9CD5E91659F
SSDEEP12288:8yhFY9EzTmmslV/EPXm5sBZS7QXBMvup4pprEVYo9TZe5CUg+AwwaQQjwG0:8yhFY9EzTmmslV/EPXm5sBZS7QXBMvuZ
TLSHT17FA4D481D72A1C7460B1C4D9F05B7A210080766CE29E182DD72D9E7FBCDE87D368B69B
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize473930
MD511378650F304E73E79824CC5E73452BC
PackageDescriptionLALR(k) parser generator -- documentation Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98. . Its salient features are: - The generated parsers are time and space efficient. On the downside, the parsers are quite large. - Frown generates four different types of parsers. as a common characteristic, the parsers are genuinely functional (ie ‘table-free’); the states of the underlying LR automaton are encoded as mutually recursive functions. Three output formats use a typed stack representation, and one format due to Ross Paterson (code=stackless) works even without a stack. - Encoding states as functions means that each state can be treated individually as opposed to a table-driven approach, which necessitates a uniform treatment of states. For instance, look-ahead is only used when necessary to resolve conflicts. - Frown comes with debugging and tracing facilities; the standard output format due to Doaitse Swierstra (code=standard) may be useful for teaching LR parsing. - Common grammatical patterns such as repetition of symbols can be captured using rule schemata. There are several predefined rule schemata. - Terminal symbols are arbitrary variable-free Haskell patterns or guards. Both terminal and nonterminal symbols may have an arbitrary number of synthesized attributes. - Frown comes with extensive documentation; several example grammars are included. Furthermore, Frown supports the use of monadic lexers, monadic semantic actions, precedences, and associativity, the generation of backtracking parsers, multiple start symbols, error reporting, and a weak form of error correction.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamefrown-doc
PackageSectiondoc
PackageVersion0.6.2.3-4
SHA-1617FAD99BD624CFCD1DDCBE2F7F8A8C275D9BC6D
SHA-256A64696946F5D493ED38EDDB4592163411B8E015336DA9ADEE412FC644E56E53D
Key Value
FileSize467960
MD53D894617A3483E1AE70524F83830C0CC
PackageDescriptionLALR(k) parser generator -- documentation Frown is an LALR(k) parser generator for Haskell 98 written in Haskell 98. . Its salient features are: - The generated parsers are time and space efficient. On the downside, the parsers are quite large. - Frown generates four different types of parsers. as a common characteristic, the parsers are genuinely functional (ie ‘table-free’); the states of the underlying LR automaton are encoded as mutually recursive functions. Three output formats use a typed stack representation, and one format due to Ross Paterson (code=stackless) works even without a stack. - Encoding states as functions means that each state can be treated individually as opposed to a table-driven approach, which necessitates a uniform treatment of states. For instance, look-ahead is only used when necessary to resolve conflicts. - Frown comes with debugging and tracing facilities; the standard output format due to Doaitse Swierstra (code=standard) may be useful for teaching LR parsing. - Common grammatical patterns such as repetition of symbols can be captured using rule schemata. There are several predefined rule schemata. - Terminal symbols are arbitrary variable-free Haskell patterns or guards. Both terminal and nonterminal symbols may have an arbitrary number of synthesized attributes. - Frown comes with extensive documentation; several example grammars are included. Furthermore, Frown supports the use of monadic lexers, monadic semantic actions, precedences, and associativity, the generation of backtracking parsers, multiple start symbols, error reporting, and a weak form of error correction.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamefrown-doc
PackageSectiondoc
PackageVersion0.6.2.3-4
SHA-192F5D793E3ED1AE1F68D8E0306BF08F51BF7E727
SHA-2564A48075DB42DFE39274FE14BB0ADEBF2510BCD04D5AE8854A20BD8E6B37D50E7