How to Install and Uninstall re2c Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: November 26,2024

1. Install "re2c" package

In this section, we are going to explain the necessary steps to install re2c on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                re2c
            
                    
    
    Copied

2. Uninstall "re2c" package

This is a short guide on how to uninstall re2c on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                re2c
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the re2c package on Ubuntu 20.10 (Groovy Gorilla)

Package: re2c
Architecture: amd64
Version: 2.0.3-1
Multi-Arch: foreign
Priority: optional
Section: devel
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: JCF Ploemen (jcfp)
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 2188
Depends: libc6 (>= 2.14), libgcc-s1 (>= 3.0), libstdc++6 (>= 5.2)
Filename: pool/main/r/re2c/re2c_2.0.3-1_amd64.deb
Size: 345448
MD5sum: 7c742b37b4c7e9477a39f3ebf17693ea
SHA1: 32d700893b8d644ae67f6bc027aa7244b2ad3e35
SHA256: 652d9a7144d4a5fe6dcfe8cb1c64053caeb9419ee82177009a9b0620b9f646de
SHA512: b21c39023630591a00578740fc4b3621c2b0f3b78d568c43d9521110dc13a933bec8be9431729e82547ccb702667bc6153d32c985111803971ffef13b01067be
Homepage: https://re2c.org
Description-en: lexer generator for C, C++ and Go
re2c's main goal is generating fast lexers: at least as fast as
their reasonably optimized hand-coded counterparts. Instead of using
a traditional table-driven approach, re2c encodes the generated
finite state automata directly in the form of conditional jumps and
comparisons. The resulting programs are faster and often smaller
than their table-driven analogues, and they are much easier to debug
and understand. Quite a few optimizations are applied in order to
speed up and compress the generated code.
.
Another distinctive feature is its flexible interface: instead of
assuming a fixed program template, re2c lets the programmer write
most of the interface code and adapt the generated lexer to any
particular environment.
Description-md5: 6058c7f3257f01efd555d3765a1a68d9