Result for 7C057BDFA18EC0BAA0FCFB0DD43AE24C9A7EF8CA

Query result

Key Value
FileName./usr/share/doc/frown/changelog.Debian.gz
FileSize2386
MD519EBB27A15932B345DBF301654BBA8CD
SHA-17C057BDFA18EC0BAA0FCFB0DD43AE24C9A7EF8CA
SHA-25616E4FDD553722B6B2C1CE2DFEA6DBD7F7EE20DCDD73C20CC902F3FACDECBCD0C
SSDEEP48:XrX0qjpQ6iNVVBfb0SjG1rs39MfrGErVjMHpQP3eGxF:7X0KliNVvfISGs3qjXV42GEF
TLSHT118413AAACD78A34C8B35C64C6620BD0E33C5DA09C22D1A476D9E37C538DED0919D38BC
hashlookup:parent-total5
hashlookup:trust75

Network graph view

Parents (Total: 5)

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

Key Value
FileSize535402
MD573A70B4B5A51D49F6319BF0CBD9D0509
PackageDescriptionLALR(k) parser generator for Haskell 98 Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown 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, 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
PackageSectiondevel
PackageVersion0.6.1-14
SHA-16AE01A2775FF53570C21D61BC0810AC6E76BB7AC
SHA-256902544AD6576BD206BCE03D4A139D5C63047E157AD4473AFAE1F73750D9C2D87
Key Value
FileSize1472930
MD59029D9FE63A32ECE5947CF06A472E917
PackageDescriptionLALR(k) parser generator for Haskell 98 Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown 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, 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
PackageSectiondevel
PackageVersion0.6.1-14
SHA-168F2430095B34F238988EC387C4BFF22522A23C7
SHA-2566705973910655771A6F667B526C140DFF482396600C45C43FAA5067BEE661F5D
Key Value
FileSize550778
MD55904F569893FE2B3C36C1FC0160DC943
PackageDescriptionManual of the frown parser generator for Haskell 98 The manual and examples of the frown LALR(k) parser generator. . Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown 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, 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.1-14
SHA-1741F5159543D11797928FBBE10A7536199199448
SHA-256AD95E695DD39B53ED46EC8922AFBC48D2EC33971C54DFAFD43E137FEAB6C3850
Key Value
FileSize581154
MD5E832C331395668439B58FDA1E8090336
PackageDescriptionLALR(k) parser generator for Haskell 98 Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown 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, 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
PackageSectiondevel
PackageVersion0.6.1-14
SHA-16199678EA994F3EE567C998F76265F7AD22F0CC7
SHA-2562E2AC8E0439153683AD7507DFE30341D07296B23421F2B1A7952022FF1129F85
Key Value
FileSize1465900
MD5363C557A82D88E38AA5C361C1198ED09
PackageDescriptionLALR(k) parser generator for Haskell 98 Frown is inspired by the parser generator Happy and uses a syntax quite simular as the syntax used by Happy. Happy only handles LALR(1) grammars while Frown can use more extensive LALR(k) grammars and the parsers generated by Frown are also faster than the parsers generated by Happy. . The salient features of Frown 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, 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
PackageSectiondevel
PackageVersion0.6.1-14
SHA-14469A65C7E488A37AC39421F17E45177B4417C00
SHA-256EBB0A3C36DA46828EB29F514B2C929E4D77122A1EDF32187BFE7DE3D0271D8F8