recursive acronym
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 218
mod_acronym
mod_acronym is a sample filter module for Acronyms. more>>
mod_acronym is a sample filter module for Acronyms.
Installation:
Directives:
AcronymFile "/path/to/acronyms.txt"
Fileformat:
< acronym > : < description > n.
or in perl: ^s*([^:]+)s*:s*(.*)$
Lines starting with a # are ignored.
Permited
On global server level only.
AcronymEnable < yes|no >
Permited
On resource level.
Compile information:
compile(c), install(i) and activate(a) with
apxs -cia mod_acronym.c
Use information:
configure by adding something like:
AcronymFile /usr/share/misc/airport
< Directory /www/htdocs/foo >
AcronymEnable yes
.....
< /Directory >
in your httpd.conf.
Caveats:
- Example code - very inefficieny.
- Does not respect html comments, tags, etc.
- Handles simple strings only - should use ptr/len to cope with binary/utf8/binary formats.
- Mangles Content-length.
- Hardcoded HTML.
- Primitive acronym detection; inflexible and inefficient.
- Ignores tags like .
- Relies on a non configurable image dagger.gif.
- Many, many more..
<<lessInstallation:
Directives:
AcronymFile "/path/to/acronyms.txt"
Fileformat:
< acronym > : < description > n.
or in perl: ^s*([^:]+)s*:s*(.*)$
Lines starting with a # are ignored.
Permited
On global server level only.
AcronymEnable < yes|no >
Permited
On resource level.
Compile information:
compile(c), install(i) and activate(a) with
apxs -cia mod_acronym.c
Use information:
configure by adding something like:
AcronymFile /usr/share/misc/airport
< Directory /www/htdocs/foo >
AcronymEnable yes
.....
< /Directory >
in your httpd.conf.
Caveats:
- Example code - very inefficieny.
- Does not respect html comments, tags, etc.
- Handles simple strings only - should use ptr/len to cope with binary/utf8/binary formats.
- Mangles Content-length.
- Hardcoded HTML.
- Primitive acronym detection; inflexible and inefficient.
- Ignores tags like .
- Relies on a non configurable image dagger.gif.
- Many, many more..
Download (0.014MB)
Added: 2006-05-26 License: The Apache License Price:
1246 downloads
File::Copy::Recursive 0.31
File::Copy::Recursive is a Perl extension for recursively copying files and directories. more>>
File::Copy::Recursive is a Perl extension for recursively copying files and directories.
SYNOPSIS
use File::Copy::Recursive qw(fcopy rcopy dircopy fmove rmove dirmove);
fcopy($orig,$new[,$buf]) or die $!;
rcopy($orig,$new[,$buf]) or die $!;
dircopy($orig,$new[,$buf]) or die $!;
fmove($orig,$new[,$buf]) or die $!;
rmove($orig,$new[,$buf]) or die $!;
dirmove($orig,$new[,$buf]) or die $!;
This module copies and moves directories recursively (or single files, well... singley) to an optional depth and attempts to preserve each file or directorys mode.
<<lessSYNOPSIS
use File::Copy::Recursive qw(fcopy rcopy dircopy fmove rmove dirmove);
fcopy($orig,$new[,$buf]) or die $!;
rcopy($orig,$new[,$buf]) or die $!;
dircopy($orig,$new[,$buf]) or die $!;
fmove($orig,$new[,$buf]) or die $!;
rmove($orig,$new[,$buf]) or die $!;
dirmove($orig,$new[,$buf]) or die $!;
This module copies and moves directories recursively (or single files, well... singley) to an optional depth and attempts to preserve each file or directorys mode.
Download (0.010MB)
Added: 2007-04-26 License: Perl Artistic License Price:
913 downloads
Module::Recursive::Require 0.04
Module::Recursive::Require is a Perl class that requires module recursively. more>>
Module::Recursive::Require is a Perl class that requires module recursive.
# ************************************** before
use MyApp::Foo;
use MyApp::Foo::CGI;
use MyApp::Foo::Mail;
use MyApp::Foo::Mail::Send;
# use use use use use !!
use MyApp::Foo::Hoge::Orz;
# ************************************** after
use Module::Recursive::Require;
use MyApp::Foo;
my @required_packages
= Module::Recursive::Require->new()->require_by(MyApp::Foo);
SYNOPSIS
use Module::Recursive::Require;
my $r = Module::Recursive::Require->new();
$r->first_loads(
qw/
MyApp::Foo::Boo
/
); # * It loads first.
$r->add_filter(qr/^Hoge/); # * Dont loaded qr/^Hoge/
$r->add_filter(qr/Base.pm$/); # * Dont loaded qr/Base.pm$/
my @packages = $r->require_of(MyApp::Foo);
# * or
my $packages_array_ref
= $r->require_of(MyApp::Foo);
METHOD ^
new( %args )
%args = (
path => /var/www/my/lib, # * default $INC[0]
extensions => pm , # * default "pm" and "pl"
);
first_loads( @package_names );
add_filter(qr/regexp/)
require_of( MyApp::Foo );
require_by( MyApp::Foo );
Deprecated. For backwards compatibility only.
<<less# ************************************** before
use MyApp::Foo;
use MyApp::Foo::CGI;
use MyApp::Foo::Mail;
use MyApp::Foo::Mail::Send;
# use use use use use !!
use MyApp::Foo::Hoge::Orz;
# ************************************** after
use Module::Recursive::Require;
use MyApp::Foo;
my @required_packages
= Module::Recursive::Require->new()->require_by(MyApp::Foo);
SYNOPSIS
use Module::Recursive::Require;
my $r = Module::Recursive::Require->new();
$r->first_loads(
qw/
MyApp::Foo::Boo
/
); # * It loads first.
$r->add_filter(qr/^Hoge/); # * Dont loaded qr/^Hoge/
$r->add_filter(qr/Base.pm$/); # * Dont loaded qr/Base.pm$/
my @packages = $r->require_of(MyApp::Foo);
# * or
my $packages_array_ref
= $r->require_of(MyApp::Foo);
METHOD ^
new( %args )
%args = (
path => /var/www/my/lib, # * default $INC[0]
extensions => pm , # * default "pm" and "pl"
);
first_loads( @package_names );
add_filter(qr/regexp/)
require_of( MyApp::Foo );
require_by( MyApp::Foo );
Deprecated. For backwards compatibility only.
Download (0.003MB)
Added: 2007-05-12 License: Perl Artistic License Price:
895 downloads
File::Attributes::Recursive 0.02
File::Attributes::Recursive module contains inherit file attributes from parent directories. more>>
File::Attributes::Recursive module contains inherit file attributes from parent directories.
SYNOPSIS
Works like File::Attributes, but will recurse up the directory tree until a matching attribute is found.
EXPORT
None, by default. Specify the functions youd like to use as arguments to the module. :all means export everything.
FUNCTIONS
get_attribute_recursively($file, [$top], $attribute)
Returns the value of attribute $attribute. If $top is specified, then the search will terminate when the path no longer contains $top. (i.e. if $file is /foo/bar/baz/quux and $top is
get_attributes_recursively($file, [$top])
Returns a hash of key value pairs for all attributes that apply to $file. Only the closest attributes are returned. Given:
/a (a = yes, foo = bar)
/a/b (b = yes, foo = baz)
/a/b/c (c = yes)
get_attributes_recursively(/a/b/c, /a) will return:
(a => yes, b => yes, c => yes, foo => baz).
The foo => bar is masked by the "closer" foo => baz.
list_attributes_recursively($file, [$top])
Returns a list of attributes that are defined and apply to $file. Like keys get_attributes_recursively($file, [$top]), but faster.
NOTABLY ABSENT FUNCTIONS
unset_attribute_recursively
There are two possible ways for this function to behave -- either recurse until the attribute is removed, or recurse to top, removing the attribute at each level. The first doesnt make sense, and the second is dangerous. If you need this function, write it for the specific needs of your application; I think thats the safest thing to do.
(Note that rm refuses to rm .., so I think theres some precedent here.)
Enhancements:
- Perl
<<lessSYNOPSIS
Works like File::Attributes, but will recurse up the directory tree until a matching attribute is found.
EXPORT
None, by default. Specify the functions youd like to use as arguments to the module. :all means export everything.
FUNCTIONS
get_attribute_recursively($file, [$top], $attribute)
Returns the value of attribute $attribute. If $top is specified, then the search will terminate when the path no longer contains $top. (i.e. if $file is /foo/bar/baz/quux and $top is
get_attributes_recursively($file, [$top])
Returns a hash of key value pairs for all attributes that apply to $file. Only the closest attributes are returned. Given:
/a (a = yes, foo = bar)
/a/b (b = yes, foo = baz)
/a/b/c (c = yes)
get_attributes_recursively(/a/b/c, /a) will return:
(a => yes, b => yes, c => yes, foo => baz).
The foo => bar is masked by the "closer" foo => baz.
list_attributes_recursively($file, [$top])
Returns a list of attributes that are defined and apply to $file. Like keys get_attributes_recursively($file, [$top]), but faster.
NOTABLY ABSENT FUNCTIONS
unset_attribute_recursively
There are two possible ways for this function to behave -- either recurse until the attribute is removed, or recurse to top, removing the attribute at each level. The first doesnt make sense, and the second is dangerous. If you need this function, write it for the specific needs of your application; I think thats the safest thing to do.
(Note that rm refuses to rm .., so I think theres some precedent here.)
Enhancements:
- Perl
Download (0.025MB)
Added: 2007-07-25 License: Perl Artistic License Price:
821 downloads
recls 1.8.10
recls (recursive ls) is a platform-independent recursive search library. more>>
recls (recursive ls) is a platform-independent recursive search library.
This library came about as the first exemplar for my C/C++ Users Journal column, Positive Integration, which deals with issues of language integration between C/C++ and a host of other languages.
The library itself is implemented in C/C++, but presents a pure C API. It is compatible with UNIX and Win32 operating systems (though the FTP recursive searching is currently Win32-only), and is compatible with most popular C/C++ compilers, including:
- Borland (v5.51+)
- Comeau (v4.3.0.1+)
- Metrowerks CodeWarrior (v8.x+)
- Digital Mars (v8.40+)
- GCC (v3.2+)
- Intel (v7.0+)
- Microsoft Visual C++ (v6.0+)
Note that the base library requires components from the STLSoft libraries (which is another open-source library Im involved with).
In addition to the base library, there are mappings to several other languages/technologies. Currently these are
"regular" C++
- D
- COM
- .NET (C# and Managed C++)
- Perl
- Python
- Ruby
- STL
Enhancements:
- In the core, Recls_SearchFeedback() (and, hence, Recls_Search()) was fixed for the case when both searchRoot and pattern are NULL; general fixes were made for Unicode compilation.
- In recls/C++, fixes were made to namespace-exports for shims for Recls::Entry class.
- In recls/STL, general fixes were made for Unicode compilation.
<<lessThis library came about as the first exemplar for my C/C++ Users Journal column, Positive Integration, which deals with issues of language integration between C/C++ and a host of other languages.
The library itself is implemented in C/C++, but presents a pure C API. It is compatible with UNIX and Win32 operating systems (though the FTP recursive searching is currently Win32-only), and is compatible with most popular C/C++ compilers, including:
- Borland (v5.51+)
- Comeau (v4.3.0.1+)
- Metrowerks CodeWarrior (v8.x+)
- Digital Mars (v8.40+)
- GCC (v3.2+)
- Intel (v7.0+)
- Microsoft Visual C++ (v6.0+)
Note that the base library requires components from the STLSoft libraries (which is another open-source library Im involved with).
In addition to the base library, there are mappings to several other languages/technologies. Currently these are
"regular" C++
- D
- COM
- .NET (C# and Managed C++)
- Perl
- Python
- Ruby
- STL
Enhancements:
- In the core, Recls_SearchFeedback() (and, hence, Recls_Search()) was fixed for the case when both searchRoot and pattern are NULL; general fixes were made for Unicode compilation.
- In recls/C++, fixes were made to namespace-exports for shims for Recls::Entry class.
- In recls/STL, general fixes were made for Unicode compilation.
Download (1.7MB)
Added: 2007-06-04 License: BSD License Price:
872 downloads
Parse::RecDescent 1.94
Parse::RecDescent is a Perl module to generate Recursive-Descent Parsers. more>>
Parse::RecDescent is a Perl module to generate Recursive-Descent Parsers.
SYNOPSIS
use Parse::RecDescent;
# Generate a parser from the specification in $grammar:
$parser = new Parse::RecDescent ($grammar);
# Generate a parser from the specification in $othergrammar
$anotherparser = new Parse::RecDescent ($othergrammar);
# Parse $text using rule startrule (which must be
# defined in $grammar):
$parser->startrule($text);
# Parse $text using rule otherrule (which must also
# be defined in $grammar):
$parser->otherrule($text);
# Change the universal token prefix pattern
# (the default is: s*):
$Parse::RecDescent::skip = [ t]+;
# Replace productions of existing rules (or create new ones)
# with the productions defined in $newgrammar:
$parser->Replace($newgrammar);
# Extend existing rules (or create new ones)
# by adding extra productions defined in $moregrammar:
$parser->Extend($moregrammar);
# Global flags (useful as command line arguments under -s):
$::RD_ERRORS # unless undefined, report fatal errors
$::RD_WARN # unless undefined, also report non-fatal problems
$::RD_HINT # if defined, also suggestion remedies
$::RD_TRACE # if defined, also trace parsers behaviour
$::RD_AUTOSTUB # if defined, generates "stubs" for undefined rules
$::RD_AUTOACTION # if defined, appends specified action to productions
Parse::RecDescent incrementally generates top-down recursive-descent text parsers from simple yacc-like grammar specifications.
Main features:
- Regular expressions or literal strings as terminals (tokens),
- Multiple (non-contiguous) productions for any rule,
- Repeated and optional subrules within productions,
- Full access to Perl within actions specified as part of the grammar,
- Simple automated error reporting during parser generation and parsing,
- The ability to commit to, uncommit to, or reject particular productions during a parse,
- The ability to pass data up and down the parse tree ("down" via subrule argument lists, "up" via subrule return values)
- Incremental extension of the parsing grammar (even during a parse),
- Precompilation of parser objects,
- User-definable reduce-reduce conflict resolution via "scoring" of matching productions.
<<lessSYNOPSIS
use Parse::RecDescent;
# Generate a parser from the specification in $grammar:
$parser = new Parse::RecDescent ($grammar);
# Generate a parser from the specification in $othergrammar
$anotherparser = new Parse::RecDescent ($othergrammar);
# Parse $text using rule startrule (which must be
# defined in $grammar):
$parser->startrule($text);
# Parse $text using rule otherrule (which must also
# be defined in $grammar):
$parser->otherrule($text);
# Change the universal token prefix pattern
# (the default is: s*):
$Parse::RecDescent::skip = [ t]+;
# Replace productions of existing rules (or create new ones)
# with the productions defined in $newgrammar:
$parser->Replace($newgrammar);
# Extend existing rules (or create new ones)
# by adding extra productions defined in $moregrammar:
$parser->Extend($moregrammar);
# Global flags (useful as command line arguments under -s):
$::RD_ERRORS # unless undefined, report fatal errors
$::RD_WARN # unless undefined, also report non-fatal problems
$::RD_HINT # if defined, also suggestion remedies
$::RD_TRACE # if defined, also trace parsers behaviour
$::RD_AUTOSTUB # if defined, generates "stubs" for undefined rules
$::RD_AUTOACTION # if defined, appends specified action to productions
Parse::RecDescent incrementally generates top-down recursive-descent text parsers from simple yacc-like grammar specifications.
Main features:
- Regular expressions or literal strings as terminals (tokens),
- Multiple (non-contiguous) productions for any rule,
- Repeated and optional subrules within productions,
- Full access to Perl within actions specified as part of the grammar,
- Simple automated error reporting during parser generation and parsing,
- The ability to commit to, uncommit to, or reject particular productions during a parse,
- The ability to pass data up and down the parse tree ("down" via subrule argument lists, "up" via subrule return values)
- Incremental extension of the parsing grammar (even during a parse),
- Precompilation of parser objects,
- User-definable reduce-reduce conflict resolution via "scoring" of matching productions.
Download (0.12MB)
Added: 2006-09-23 License: Perl Artistic License Price:
1131 downloads
import_checker 1.1
import_checker checks Python programs for circular (or recursive) imports. more>>
import_checker checks Python programs for circular (or recursive) imports.
Python is a fine programming language. There is one horrendous thing with it though, that bites even the most experienced python programmers every now and then: the scope of variables.
Weve been taught to use the keyword global, and heartily do so. Still, problems occur when running into a "recursive import" problem.
Example:
### program A ###
import B
var = 0
if __name__ == __main__:
var = 10
B.doit()
### module B ###
import A
def doit():
print A.var
### end of example ###
Module B will see A.var having value 0, even though in program A we assigned it a value of 10. Python is right and it is not a python bug, but it is $#@! confusing and it is being caused by the recursive import; A imports B, and B imports A.
The import_checker.py is a tool that detects recursive imports.
This problem only occurs for global variables in modules.
The best way of solving the problem is to put var into a new module C,
and import C from both A and B.
<<lessPython is a fine programming language. There is one horrendous thing with it though, that bites even the most experienced python programmers every now and then: the scope of variables.
Weve been taught to use the keyword global, and heartily do so. Still, problems occur when running into a "recursive import" problem.
Example:
### program A ###
import B
var = 0
if __name__ == __main__:
var = 10
B.doit()
### module B ###
import A
def doit():
print A.var
### end of example ###
Module B will see A.var having value 0, even though in program A we assigned it a value of 10. Python is right and it is not a python bug, but it is $#@! confusing and it is being caused by the recursive import; A imports B, and B imports A.
The import_checker.py is a tool that detects recursive imports.
This problem only occurs for global variables in modules.
The best way of solving the problem is to put var into a new module C,
and import C from both A and B.
Download (0.009MB)
Added: 2006-10-24 License: GPL (GNU General Public License) Price:
1095 downloads
Guile 0.002
Guile is a Perl interface to the Guile Scheme interpreter. more>>
Guile is a Perl interface to the Guile Scheme interpreter.
SYNOPSIS
use Guile;
print "1 + 1 = ", Guile::eval_str("(+ 1 1)"), "n";
This module provides an interface to the Gnu Guile system. You can find out more about Guile at:
http://www.gnu.org/software/guile/guile.html.
Guile is an interpreter for the Scheme programming language. "Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman." You can find this quote in the language definition for Scheme here:
http://www-swiss.ai.mit.edu/~jaffer/r5rs_toc.html
This module is being developed in order to support the development and usage of an Inline::Guile module. The intention is to allow Perl programmers to intermix Perl and Guile code in their programs and modules.
<<lessSYNOPSIS
use Guile;
print "1 + 1 = ", Guile::eval_str("(+ 1 1)"), "n";
This module provides an interface to the Gnu Guile system. You can find out more about Guile at:
http://www.gnu.org/software/guile/guile.html.
Guile is an interpreter for the Scheme programming language. "Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman." You can find this quote in the language definition for Scheme here:
http://www-swiss.ai.mit.edu/~jaffer/r5rs_toc.html
This module is being developed in order to support the development and usage of an Inline::Guile module. The intention is to allow Perl programmers to intermix Perl and Guile code in their programs and modules.
Download (0.028MB)
Added: 2007-05-14 License: Perl Artistic License Price:
915 downloads
myXTree 1.0
myXTree provides an interface to an SQL tree. more>>
myXTree provides an interface to an SQL tree.
myXTree is an interface to a SQL-tree. It is more about SQL-trees can learn in article SQL for Smarties and Relational Data Structures for Extensible Thesauri. This class allows to save the DOM-document in a SQL-tree and vice versa. For a choice of the data from a SQL-tree are used XPath expressions. Data reading of a SQL-tree can be carried out by two ways: by one SQL-query and recursive way.
The myXTree class use object PEAR::DB and object Document from package myDOM, which goes into package myXML.
Attached to realization of this class used a database mySQL and object PEAR::DB, but this, to regretting, does not do a class lightly bearable on other databases, because in class are used the specialized features mySQL. Because supposed, in the main, use of this class for little renewed data, then was select a tables type MyISAM (unsupported transaction).
A class does not support full features of XPath language. So far does not support an objects selection on namespace prefix; in base saved only the elements, text, CDATA and attributes; use of operator ??? (union) impossible only in recursive method; the XPath functions not implemented.
Enhancements:
- Error handling is completely advanced. PEAR style of error handling is extended with a new class "Error" (see file Error.php for details).
- The code became easier for understanding and for debugging.
<<lessmyXTree is an interface to a SQL-tree. It is more about SQL-trees can learn in article SQL for Smarties and Relational Data Structures for Extensible Thesauri. This class allows to save the DOM-document in a SQL-tree and vice versa. For a choice of the data from a SQL-tree are used XPath expressions. Data reading of a SQL-tree can be carried out by two ways: by one SQL-query and recursive way.
The myXTree class use object PEAR::DB and object Document from package myDOM, which goes into package myXML.
Attached to realization of this class used a database mySQL and object PEAR::DB, but this, to regretting, does not do a class lightly bearable on other databases, because in class are used the specialized features mySQL. Because supposed, in the main, use of this class for little renewed data, then was select a tables type MyISAM (unsupported transaction).
A class does not support full features of XPath language. So far does not support an objects selection on namespace prefix; in base saved only the elements, text, CDATA and attributes; use of operator ??? (union) impossible only in recursive method; the XPath functions not implemented.
Enhancements:
- Error handling is completely advanced. PEAR style of error handling is extended with a new class "Error" (see file Error.php for details).
- The code became easier for understanding and for debugging.
Download (0.054MB)
Added: 2007-04-04 License: LGPL (GNU Lesser General Public License) Price:
935 downloads
SearchChips Bookmarker 1.0
SearchChips Bookmarker is an extension used to add all of your favorite link to your webpage. more>>
SearchChips Bookmarker is an extension used to add all of your favorite link to your webpage.
Add all of your favorite link to your webpage with the Bookmarking Button for SearchChips.
A hyperlink (often referred to as simply a link), is a reference or navigation element in a document to another section of the same document, another document, or a specified section of another document, that automatically brings the referred information to the user when the navigation element is selected by the user.
As such it is similar to a citation in literature, but with the distinction of automatic instant access. Combined with a data network and suitable access protocol, a computer can be instructed to fetch the resource referenced.
Hyperlinks are part of the foundation of the World Wide Web created by Tim Berners-Lee, but are not limited to HTML or the web. Hyperlinks may be used in almost any electronic media.
HREF is an acronym for Hypertext REFerence, as used in HTML.
<<lessAdd all of your favorite link to your webpage with the Bookmarking Button for SearchChips.
A hyperlink (often referred to as simply a link), is a reference or navigation element in a document to another section of the same document, another document, or a specified section of another document, that automatically brings the referred information to the user when the navigation element is selected by the user.
As such it is similar to a citation in literature, but with the distinction of automatic instant access. Combined with a data network and suitable access protocol, a computer can be instructed to fetch the resource referenced.
Hyperlinks are part of the foundation of the World Wide Web created by Tim Berners-Lee, but are not limited to HTML or the web. Hyperlinks may be used in almost any electronic media.
HREF is an acronym for Hypertext REFerence, as used in HTML.
Download (0.011MB)
Added: 2007-04-04 License: MPL (Mozilla Public License) Price:
933 downloads
regexxer 0.9
regexxer project is a nifty search/replace tool featuring Perl-style regular expressions. more>>
regexxer project is a nifty search/replace tool featuring Perl-style regular expressions.
It features recursive search through directory trees and Perl-style regular expressions (using libpcre). The user interface is similar to the project-wide search/replace dialog in the Sniff+ IDE, but regexxer aims to surpass it.
<<lessIt features recursive search through directory trees and Perl-style regular expressions (using libpcre). The user interface is similar to the project-wide search/replace dialog in the Sniff+ IDE, but regexxer aims to surpass it.
Download (0.29MB)
Added: 2007-02-21 License: GPL (GNU General Public License) Price:
977 downloads
calltree 2.3
calltree is a static call tree generator for C programs. more>>
The calltree command parses a collection of input files (assuming C syntax) and builds a graph that represents the static call structure of these files.
Calltree is similar to cflow(1) but unlike cflow(1), calltree is not based on lint(1).Calltree implements some more functions than cflow(1), but does not list the return types of the functions. This is because calltree includes an own C parser and thus may be used even on systems that dont have lint(1).
The disadvantage is that the C parser that is used by calltree is not completely correct and may not find all calls of a function. This is mainly true for calls that are done via function pointers.
Calltree is able to detect recursive function calls (e.g. functions that call themselves). Recursive function calls are marked with an ellipsis in the output.
<<lessCalltree is similar to cflow(1) but unlike cflow(1), calltree is not based on lint(1).Calltree implements some more functions than cflow(1), but does not list the return types of the functions. This is because calltree includes an own C parser and thus may be used even on systems that dont have lint(1).
The disadvantage is that the C parser that is used by calltree is not completely correct and may not find all calls of a function. This is mainly true for calls that are done via function pointers.
Calltree is able to detect recursive function calls (e.g. functions that call themselves). Recursive function calls are marked with an ellipsis in the output.
Download (0.24MB)
Added: 2005-04-13 License: GPL (GNU General Public License) Price:
1669 downloads
DParser 1.15
DParser is an simple but powerful tool for parsing. more>>
DParser project is an simple but powerful tool for parsing. You can specify the form of the text to be parsed using a combination of regular expressions and grammar productions.
Because of the parsing technique (technically a scannerless GLR parser based on the Tomita algorithm) there are no restrictions.
The grammar can be ambiguous, right or left recursive, have any number of null productions, and because there is no seperate tokenizer, can include whitespace in terminals and have terminals which are prefixes of other terminals.
DParser handles not just well formed computer languages and data files, but just about any wacky situation that occurs in the real world.
Main features:
- Powerful GLR parsing
- Simple EBNF-style grammars and regular expression terminals
- Priorities and associativities for token and rules
- Built-in error recovery
- Speculative actions (for semantic disambiguation)
- Auto-building of parse tree (optionally)
- Final actions as you go, or on the complete parse tree
- Tree walkers and default actions (multi-pass compilation support)
- Symbol table built for ambiguous parsing
- Partial parses, recursive parsing, parsing starting with any non-terminal
- Whitespace can be specified as a subgrammar
- External (C call interface) tokenizers and external terminal scanners
- Good asymptotically efficiency
- Comes with ANSI-C, Python and Verilog grammars
- Comes with full source
- Portable C for easy compilation and linking
- BSD licence, so you can included it in your application without worrying about licensing
Enhancements:
- Removed call to exec in python interface (Brian Sabbey)
- Fix binary_op_left in python interface (Brian Sabbey)
<<lessBecause of the parsing technique (technically a scannerless GLR parser based on the Tomita algorithm) there are no restrictions.
The grammar can be ambiguous, right or left recursive, have any number of null productions, and because there is no seperate tokenizer, can include whitespace in terminals and have terminals which are prefixes of other terminals.
DParser handles not just well formed computer languages and data files, but just about any wacky situation that occurs in the real world.
Main features:
- Powerful GLR parsing
- Simple EBNF-style grammars and regular expression terminals
- Priorities and associativities for token and rules
- Built-in error recovery
- Speculative actions (for semantic disambiguation)
- Auto-building of parse tree (optionally)
- Final actions as you go, or on the complete parse tree
- Tree walkers and default actions (multi-pass compilation support)
- Symbol table built for ambiguous parsing
- Partial parses, recursive parsing, parsing starting with any non-terminal
- Whitespace can be specified as a subgrammar
- External (C call interface) tokenizers and external terminal scanners
- Good asymptotically efficiency
- Comes with ANSI-C, Python and Verilog grammars
- Comes with full source
- Portable C for easy compilation and linking
- BSD licence, so you can included it in your application without worrying about licensing
Enhancements:
- Removed call to exec in python interface (Brian Sabbey)
- Fix binary_op_left in python interface (Brian Sabbey)
Download (0.26MB)
Added: 2006-10-18 License: BSD License Price:
1103 downloads
Spirit Parser library 1.8.2
Spirit Parser library is an object-oriented, recursive descent parser generator framework. more>>
Spirit is an object oriented recursive descent parser generator framework implemented using template meta-programming techniques. Expression templates allow us to approximate the syntax of Extended Backus Normal Form[1] (EBNF) completely in C++.
Parser objects are composed through operator overloading and the result is a backtracking LL(inf) parser that is capable of parsing rather ambiguous grammars.
The Spirit framework enables a target grammar to be written exclusively in C++. Inline EBNF grammar specifications can mix freely with other C++ code and, thanks to the generative power of C++ templates, are immediately executable. In retrospect, conventional compiler-compilers or parser-generators have to perform an additional translation step from the source EBNF code to C or C++ code.
Spirit is part of Boost Libraries, a peer-reviewed, open collaborative development effort.
Enhancements:
- Fixed bug where a match is a variant.
- added Jamfile/Jamrules from CVS to spirit-1.8.1/
- added boost-build.jam from boost to spirit-1.8.1/
- disabled template multi-threading in libs/spirit/test/Jamfile
- added a boost-header-include rule (from spirit-header-include) pointing to miniboost in libs/spirit/test/Jamfile
- Fixed if_p inconsistency
<<lessParser objects are composed through operator overloading and the result is a backtracking LL(inf) parser that is capable of parsing rather ambiguous grammars.
The Spirit framework enables a target grammar to be written exclusively in C++. Inline EBNF grammar specifications can mix freely with other C++ code and, thanks to the generative power of C++ templates, are immediately executable. In retrospect, conventional compiler-compilers or parser-generators have to perform an additional translation step from the source EBNF code to C or C++ code.
Spirit is part of Boost Libraries, a peer-reviewed, open collaborative development effort.
Enhancements:
- Fixed bug where a match is a variant.
- added Jamfile/Jamrules from CVS to spirit-1.8.1/
- added boost-build.jam from boost to spirit-1.8.1/
- disabled template multi-threading in libs/spirit/test/Jamfile
- added a boost-header-include rule (from spirit-header-include) pointing to miniboost in libs/spirit/test/Jamfile
- Fixed if_p inconsistency
Download (2.27MB)
Added: 2005-04-22 License: zlib/libpng License Price:
1647 downloads
acrotsr 0.8.0
acrotsr is an IRC game in which players are given an acronym and they have to guess what the acronym stands for. more>>
acrotsr is a small IRC game in which players are given an acronym.
The players have a certain amount of time to think of what the acronym should stand for, then the people in the channel vote for the one they like most.
<<lessThe players have a certain amount of time to think of what the acronym should stand for, then the people in the channel vote for the one they like most.
Download (0.051MB)
Added: 2006-09-15 License: GPL (GNU General Public License) Price:
1134 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above recursive acronym search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
