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
FileSize	1687038
MD5	28828B659B6A36918D77857832E0126C
PackageDescription	LALR(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. . Homepage: http://www.informatik.uni-bonn.de/~ralf/frown/index.html
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown
PackageSection	devel
PackageVersion	0.6.1-6
SHA-1	31784888944A203E2EF498DD62B74D12D454B703
SHA-256	961FFDE5AFFD5681A49942F6FE8C328A6ECD40ED2EE9DF039E82C2F701AB54E8

Key	Value
FileSize	2185882
MD5	0110AA2857A030B5A5A186C00C034BB2
PackageDescription	LALR(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. . Homepage: http://www.informatik.uni-bonn.de/~ralf/frown/index.html
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown
PackageSection	devel
PackageVersion	0.6.1-6
SHA-1	C8D4EFF5F2045000BED361E8402FBD1E9B663597
SHA-256	30A881BF30FBB2CC2A6ACBF1988EC4205141EB84DB911EFEE3673560E403029A

Key	Value
FileSize	1672146
MD5	9C4B97DD3B2B3947A3602AD2C89C027B
PackageDescription	LALR(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. . Homepage: http://www.informatik.uni-bonn.de/~ralf/frown/index.html
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown
PackageSection	devel
PackageVersion	0.6.1-6
SHA-1	516B23799BE5134984CCF48B0FAB562F3FFCF672
SHA-256	0EAA4BC17F48C65811214A8C65014304DB0D6CD68CA8A395075C480F6C5C49EF

Key	Value
FileSize	1155338
MD5	270BD04B8A7215798021C3D977ECE1BF
PackageDescription	LALR(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. . Homepage: http://www.informatik.uni-bonn.de/~ralf/frown/index.html
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown
PackageSection	devel
PackageVersion	0.6.1-6
SHA-1	C2407ECC711AB0F04EC76CB2D31D7CBEBB0F8A66
SHA-256	8CCECE8F4B9A3F82767D303BC3EE1E9EF30B1CAACA1B6899E03BCCB7005C06EA

Key	Value
FileSize	1117796
MD5	E4E69A4F1F6681846981A3C10AC906A4
PackageDescription	LALR(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. . Homepage: http://www.informatik.uni-bonn.de/~ralf/frown/index.html
PackageMaintainer	Ubuntu MOTU Developers <ubuntu-motu@lists.ubuntu.com>
PackageName	frown
PackageSection	devel
PackageVersion	0.6.1-6
SHA-1	C4971EA6F6DF9D538CBB335DFEE98EABDA5C56D5
SHA-256	B87042C007431B98B37ECF6EB90372DF0E5441CB9CE7D036937B823770B274C0