|
|
|||
![]() PVS-Studio Static Code Analyzer for 64-bit and parallel C/C++ code
|
|||
![]() ![]() ![]() ![]() ![]()
02.09.2010
Feeling the new Intel Parallel Studio XE 2011 beta So I've gotten to try the C++ compiler included into Intel Parallel Studio XE 2011 beta at last.»
30.08.2010
Five days for fixing a two-character error, or a myth of almighty technologies aiding software development In this blog, you may often read posts about how this or that software tool or software development technology helps make fewer errors, find them faster and correct them easier.»
30.08.2010
d'Artagnan and Internet, or working on the problem of bad links Friends, it is high time we stopped considering links only in the context of their number and buying/ selling and counting PR of the site they are laid out on.» ![]()
10.09.2010
Regular use of static code analysis in team development The article discusses different levels of using static code analysis technologies in team development and shows how to "move" the process from one level to another.»
22.07.2010
Using PVS-Studio with continuous integration systems This article illustrates techniques required to employ the use of PVS-Studio static code analyzer together with continuous integration systems.»
06.07.2010
Comparing capabilities of PVS-Studio and Visual Studio 2010 in detecting defects in 64-bit programs
In the article, we will compare three mechanisms of code analysis from the viewpoint of detecting 64-bit errors: the Visual C++ 2010 compiler, the Code Analysis for C/C++ component included into Visual Studio 2010 and Viva64 analyzer included into PVS-Studio 3.60.» ![]() |
Terminology![]() Abstract syntactical treeAbstract syntactical tree. Other names: Kantorovich's tree, Abstract Syntax Tree (AST). An abstract syntactical tree is the final, marked, oriented tree the inner tops of which are correlated with the programming language's operands, and the leaves with the corresponding operands. Thus, the leaves are empty operators and serve only as variables and constants. AST differs from the parse tree in that it keeps only the essential information about the program while the parse tree, on the contrary, contains much unnecessary information. In this sense the abstract syntactical tree is a condensed form of the parse tree convenient for presenting the language constructions' structure from the semantics' viewpoint. References
| ||