Parents (Total: 15)
The searched file hash is included in 15 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
FileSize | 244084 |
MD5 | 45A18F7CC64AC7B54A47292133647245 |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.76-1 |
SHA-1 | 3F9F2FD10184AA10DB6A04BF49782F214763E429 |
SHA-256 | D63E0DE19662D774A77E521BEAE43FC8B38825B7489A69A06CDF9702D82533F5 |
Key |
Value |
FileSize | 191932 |
MD5 | 8FA89530590026C5D7DB70FD35D1294A |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-4 |
SHA-1 | CDCDCDE719C97259974BCA49996F17A1E7B13C33 |
SHA-256 | 46F609265BBC072043363077108B6EA4F7E640FD54D9060D39DBE5FCF9F4F4F6 |
Key |
Value |
FileSize | 196852 |
MD5 | 200391C15A79C23CA90152EDC73A3A54 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-6 |
SHA-1 | 6C1C66A062D2650AA14D051B6430EBDEB1EAE836 |
SHA-256 | 3C90BE463233A017AF3C04E8F6A1E520B2EF41018EA4A7EFB73A997AC38B8FB8 |
Key |
Value |
FileSize | 191966 |
MD5 | 89E361E38CFEB395CD87A4C10C89E794 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-4 |
SHA-1 | C099A32F2F2470C09FA92453AB2FD2364AC5E8F9 |
SHA-256 | 28D9D183D362E95515DFFC80415F68C48358280D537D93FC3AEE26BA116A86C7 |
Key |
Value |
FileSize | 192326 |
MD5 | F37257CE9808A0A261DD788D45C72167 |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | James McCoy <jamessan@debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.76-2 |
SHA-1 | 43593AE20EAE52D377BBB18D85AA8FBE2283F5AB |
SHA-256 | E7EDFA431337D3DB7E9C208C3D41220D90311951EE57368BB66E2950EE67ABA8 |
Key |
Value |
FileSize | 196586 |
MD5 | 5B05F860CB233718A551FCC332A1D19D |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-2+b1 |
SHA-1 | 8CF2E3B132287FE6CF92C552ABEDAE9034BC72D1 |
SHA-256 | EEA123037A2CFF1BE3DA3A705DF856120F1E3F47159672B283B0511A08D231B3 |
Key |
Value |
FileSize | 196982 |
MD5 | A9F3B7E5D3A72D0B4DB914940BFF2D97 |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-2+b1 |
SHA-1 | 16E69D9C9935893B91DA9F217EF1FDCCF91AEDBD |
SHA-256 | A0FBEBF6C967E7B91B04B6E5CD44BF93722BAA954919FA27A82A583D877EDB1C |
Key |
Value |
CRC32 | BBF7AADF |
FileName | 54845 |
FileSize | 188602 |
MD5 | E0385D0CA2253CBF3362D8ECA3B6F492 |
OpSystemCode | 362 |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.78-2 |
ProductCode | 184819 |
RDS:package_id | 184819 |
SHA-1 | 005CBF4BC0124703AD41B0A1E14815DD659B6828 |
SHA-256 | C7DE52168DA3882A7850A2A0C76E1EAA5911E5090C7655455C4AA4FE96C25703 |
SpecialCode | |
db | nsrl_legacy |
insert-timestamp | 1648719972.9971054 |
source | RDS_2022.03.1_legacy.db |
Key |
Value |
FileSize | 196924 |
MD5 | D3033663AD8BF773AF9C69EB6B5C93A5 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-4 |
SHA-1 | 1055FC45299A4A5352C9E276928008675D7E979D |
SHA-256 | 2B94AA6DAF677B21BB6798A4133CEFC75B32ACAEF59364D56AAC9D36FBF6AB63 |
Key |
Value |
FileSize | 196820 |
MD5 | D1351BDA1FF694F4C63F93DD7DF86879 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-4 |
SHA-1 | 16323C8E96F6C3476FCED96731DBBA7D07F7EA27 |
SHA-256 | E7A75D4B58BD1B06EBBF126EB98D9BB2E6D25127AB7F9A9D94623AE42E6EC3FD |
Key |
Value |
FileSize | 192482 |
MD5 | E6D947E0749209E24E8F65EA1D8BC5D2 |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | James McCoy <jamessan@debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.76-2 |
SHA-1 | B8694162A80A9E6C824F904B47D874D4D99E59BA |
SHA-256 | 8B5CB01CCB4A28553740E4B08B38302226F8659D81A6387F712BFBDB9560C792 |
Key |
Value |
FileSize | 188174 |
MD5 | 12F011D0ACD05D70A08CAFA3E7B2172D |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.78-2 |
SHA-1 | B5E5573EC76AFC0F3BB358ACCC23FBF0D24A895B |
SHA-256 | C4F5927AE835E6609579D5B92E1336D727F2350D43450A57D3EBB1D4E3CE5A26 |
Key |
Value |
FileSize | 192024 |
MD5 | 8394EBF3FB93D46C7BDF916D63D70C72 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-6 |
SHA-1 | 48C1698AF66423533F9C0CB85F7CDC86172E9A2D |
SHA-256 | 860F00ACF038AF673E84E1EEC337313D80667883F867E925BC78D8338916D1D4 |
Key |
Value |
FileSize | 197044 |
MD5 | 541FDBB74B7489D43DED840ED7902B78 |
PackageDescription | Code generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Debian QA Group <packages@qa.debian.org> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.79-6 |
SHA-1 | 162F0345AE4A796B978179C8CEA0414F45E2C33F |
SHA-256 | 0566DAD37BD23675DFD47F5A47998AD7E330B11F79A891C221E12B7106886BF7 |
Key |
Value |
FileSize | 243260 |
MD5 | E01589DED2AF620AB387DA98684514FF |
PackageDescription | Code generator generator for Standard ML
ml-burg generates a Standard ML program to perform bottom-up
rewriting of an input tree. Cost information associated with each
rewrite rule is used to derive the minimum rewrite cost for the
entire tree. A successful reduction corresponds to rewriting the
input tree to a special non-terminal symbol called the "start"
non-terminal. Upon successful reduction, facilities are provided to
walk the tree emitting semantic actions corresponding to the rules
that matched.
.
Install this package if you want to write a compiler in SML using a
burg specification. |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | ml-burg |
PackageSection | devel |
PackageVersion | 110.76-1 |
SHA-1 | 7CFE12004ED46B52810D277352EF57DD31FC501D |
SHA-256 | B77D490B5A99883FF574659FBA48513C4815F79261153851A87BFEB569EE60CD |