How to Install and Uninstall ml-burg Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 02,2024

1. Install "ml-burg" package

This guide covers the steps necessary to install ml-burg on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                ml-burg
            
                    
    
    Copied

2. Uninstall "ml-burg" package

Here is a brief guide to show you how to uninstall ml-burg on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                ml-burg
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the ml-burg package on Ubuntu 21.10 (Impish Indri)

Package: ml-burg
Architecture: amd64
Version: 110.79-6
Priority: optional
Section: universe/devel
Source: smlnj
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian QA Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 701
Depends: ml-lex (= 110.79-6)
Filename: pool/universe/s/smlnj/ml-burg_110.79-6_amd64.deb
Size: 192024
MD5sum: 8394ebf3fb93d46c7bdf916d63d70c72
SHA1: 48c1698af66423533f9c0cb85f7cdc86172e9a2d
SHA256: 860f00acf038af673e84e1eec337313d80667883f867e925bc78d8338916d1d4
SHA512: 6cc584d40d44affa0a8be33f69c3b7431fa78749ace12475fcb21d75167f414288e2bb60290ff9dc2ff15f163101177fd471adeda5843ec7672532da2e75c71f
Homepage: http://www.smlnj.org/
Description-en: 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.
Description-md5: 9342eacca7f9e27adb803b52a0163be4