Need help with DelphiAST?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

RomanYankovsky
193 Stars 85 Forks Mozilla Public License 2.0 402 Commits 89 Opened issues

Description

Abstract syntax tree builder for Delphi

Services available

!
?

Need anything else?

Contributors list

# 37,940
Shell
pascal
python-...
pattern
197 commits
# 283,262
vscode
lldb
Shell
syntax-...
101 commits
# 310,483
delphi
pascal
syntax-...
22 commits
# 557,957
syntax-...
delphi
pascal
6 commits
# 420,755
delphi
pascal
Windows
syntax-...
5 commits
# 502,079
languag...
syntax-...
delphi
pascal
4 commits
# 475,797
Shell
syntax-...
delphi
pascal
2 commits
# 173,863
delphi
pascal
mocking...
Shell
1 commit
# 344,175
Windows
WPF
vpn-cli...
syntax-...
1 commit
# 687,260
syntax-...
delphi
pascal
Shell
1 commit
# 590,838
syntax-...
delphi
pascal
treevie...
1 commit

Abstract Syntax Tree Builder for Delphi

With DelphiAST you can take real Delphi code and get an abstract syntax tree. One unit at time and without a symbol table though.

FreePascal and Lazarus compatible.

Sample input

unit Unit1;

interface

uses Unit2;

function Sum(A, B: Integer): Integer;

implementation

function Sum(A, B: Integer): Integer; begin Result := A + B; end;

end.

Sample outcome

  
    
      
    
    
      
        
          
          
        
        
          
          
        
      
      
        
      
    
  
  
    
      
        
          
          
        
        
          
          
        
      
      
        
      
      
        
          
            
          
          
            
              
                
                
              
            
          
        
      
    
  

Copyright

Copyright (c) 2014-2020 Roman Yankovsky ([email protected]) et al

DelphiAST is released under the Mozilla Public License, v. 2.0

See LICENSE for details.

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.