Main > Free Download Search >

Free lr software for linux

lr

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 15
Solaris::MapDev 0.05a

Solaris::MapDev 0.05a


Solaris::MapDev Perl module contains a map between instance numbers and device names. more>>
Solaris::MapDev Perl module contains a map between instance numbers and device names.

SYNOPSIS

use Solaris::MapDev qw(inst_to_dev dev_to_inst);
my $disk = inst_to_dev("sd0");
my $nfs = inst_to_dev("nfs123");
my $inst = dev_to_inst("c0t0d0s0");
mapdev_data_files(path_to_inst => "/copy/of/a/path_to_inst",
mnttab => "/copy/of/a/mnttab",
dev_ls => { "/dev/rdsk" => "ls-lR/of/dev_dsk",
"/dev/rmt" => "ls-lR/of/dev_rmt" });
my $tape = inst_to_dev("st1");

This module maps both ways between device instance names (e.g. sd0) and /dev entries (e.g. c0t0d0). Vanilla SCSI disks, SSA disks, A1000, A3000, A3500 and A5000 disks are all catered for, as are tape devices and NFS mounts.

FUNCTIONS

inst_to_dev($inst)

Return the device name name given the instance name

dev_to_inst($dev)

Return the instance name given the device name

get_inst_names

Return a sorted list of all the instance names

get_dev_names

Return a sorted list of all the device names

mapdev_data_files

This tells mapdev to use data held in copies of the real datafiles, rather than the current "live" files on the system. This is useful for example when examining explorer output. A list of key-value pairs is expected as the arguments. Valid keys-value pairs are:

path_to_inst => "/copy/of/a/path_to_inst",

A valid path_to_inst file. This is mandatory.

mnttab => "/copy/of/a/mnttab",

A valid /etc/mnttab file. This is optional - if not
specified, no information on NFS devices will be displayed.

dev_ls => { "/dir/path" => "/ls-lR/of/dir/path",
... });

A hash containing path/datafile pairs. The paths should
be one of /dev/rdsk, /dev/osa/rdsk, /dev/osa/dev/rdsk or
/dev/rmt. The datafiles should be the output of a "ls -l"
of the specified directory. A single file containing a
recursive "ls -Rl" of /dev is also acceptable.

mapdev_system_files

This tells mapdev to revert to using the current "live" datafiles on the system - see "mapdev_data_files()"

<<less
Download (0.024MB)
Added: 2007-06-13 License: GPL (GNU General Public License) Price:
865 downloads
Kelbt 0.12

Kelbt 0.12


Kelbt generates backtracking LALR parsers. more>>
Kelbt project can generate backtracking LALR parsers. Standard LALR parser generators emit an error upon encountering a conflict in the parse tables. Kelbt forges onward, generating parsers which handle conflicts by backtracking at runtime. Kelbt is able to generate a parser for any context-free grammar and therefore implements a generalized parsing method.
Kelbt is different from other backtracking LR systems in two ways. First, it elevates backtracking to the level of semantic actions by introducing a class of actions called undo actions. Undo actions are invoked as the backtracker undoes parsing and allow the user to revert any side effects of forward semantic actions. This makes it possible to backtrack over language constructs which must modify global state in preparation for handling context dependencies.
Second, Kelbt enables a user-controlled parsing strategy which approximates that of generalized recursive-descent parsing. This makes it easy for the user to resolve language ambiguities by ordering the grammar productions of a nonterminal according to their precedence. It is approximate in the sense that for most grammars the equivalent of an ordered choice parsing strategy is achieved. In cases where productions are parsed out of the order given, there is a simple grammar transformation which remedies the problem. See the CASCON paper for more details.
As a proof of concept, Kelbt has been used to write a partial C++ parser (included) which is composed of strictly a scanner, a name lookup stage and a grammar with standard semantic actions and semantic undo actions.
Enhancements:
- The -l option was added for turning off line directives in generated code.
- The class keyword was added.
- This indicates that a nonterminal or the token type is a C++ class, and should have its constructors and destructors called.
- The shortest statement was added.
- This allows one to force a shortest match of a list of items.
- The semantics of commit was changed.
- It now forces a full commit rather than a scoped commit.
- Many other improvements were made.
<<less
Download (0.21MB)
Added: 2007-05-02 License: GPL (GNU General Public License) Price:
905 downloads
Parsing 1.3

Parsing 1.3


Parsing module is a pure-Python module that implements an LR(1) parser generator, as well as CFSM and GLR parser drivers. more>> <<less
Download (0.081MB)
Added: 2007-08-14 License: MIT/X Consortium License Price:
805 downloads
tooLAME 0.2i

tooLAME 0.2i


tooLAME is an optimized Mpeg Audio 1/2 Layer 2 encoder. more>>
tooLAME is an optimized Mpeg Audio 1/2 Layer 2 encoder.

It is based heavily on:

- the ISO dist10 code
- improvement to algorithms as part of the LAME project

Installation:

1. edit Makefile
at least change the architecture type (ARCH) to suit your machine.
2. make

Usage:

./toolame [options] < input > < output >

Input File
tooLAME parses AIFF and WAV files for file info
raw PCM is assumed if no header is found
for stdin use a -

Output File
file is automatically renamed from *.* to *.mp2
for stdout use a -

Input Options
-s [int]
if inputting raw PCM sound, you must specify the sample rate
default sample rate is 44.1khz.

-a
downmix from stereo to mono
if the incoming file is stereo, combine the audio into
a single channel

-x
force byte-swapping of the input. (current endian detection is dodgy,
so if toolame produces only noise, use -x )

-g
swap the LR channels of a stereo file

Output Options
-m [char]
the encoding mode (default j)
s stereo
d dual channel
j joint stereo
m mono

-p [int]
which psy model to use (default 1)
Different models for the psychoacoustics
Models: -1 to 4

-b [int]
the total bitrate
For 48/44.1/32kHz default = 192
For 24/22.05/16kHz default = 96

-v [int]
Switch on VBR mode.
The higher the number the better the quality.
Useful range -10 to 10.
See README.VBR for details.

Operation
-f
fast mode turns off calculation of the psychoacoustic model.
Instead a set of default values are assumed

-q [int]
quick mode calculates the psy model every num frames.

Misc
-d emp
de-emphasis (default n)
-c
mark as copyright
-o
mark as original
-e
add error protection
-r
force padding bits off
-D
add DAB extensions
-t [int]
talkativity setting. 0 = no message. 3 = too much information
<<less
Download (0.12MB)
Added: 2005-12-20 License: GPL (GNU General Public License) Price:
1403 downloads
Rats! 1.12.0

Rats! 1.12.0


Rats! is an easily extensible parser generator for C-like languages. more>>
Rats! is an easily extensible parser generator for C-like languages; though currently it only generates parsers in Java. Rats! project has been explicitly designed so that grammars are concise and easily modifiable. To this end, Rats!
- organizes grammars into modules,
- builds on parsing expression grammars instead of context-free grammars and vintegrates lexing with parsing, i.e., is scannerless,
- supports the automatic generation of abstract syntax trees,
- and provides a well-defined interface for extending parsers to recognize context-sensitive languages and formats.
Parsers generated by Rats! memoize intermediate results, which ensures linear time performance in the presence of unlimited lookahead and backtracking. As a result, they are essentially functional (even though they are implemented in an imperative language) and also called "packrat parsers."
Main features:
- Rats! relies on a module system to structure grammars and their extensions. In particular, it relies on modules to group related productions into separate units. Next, module modifications concisely express extensions to other modules and can add, change, or remove individual alternatives in productions. Finally, module parameters are used to compose modules and their extensions with each other.
- Rats! grammars build on parsing expression grammars (PEGs). While PEGs share many constructs with the familiar EBNF notation, a key difference is that they utilize ordered choices instead of the unordered choices used by context-free grammars (CFGs) and other parser generators, such as Yacc or ANTLR. As a result, Rats! grammars avoid ambiguities and support localized changes. Additional flexibility is offered through syntactic predicates, which match expressions but do not consume the input, thus providing unlimited lookahead, and through the integration of lexing with parsing, which greatly simplifies the addition of new tokens to a grammar. PEGs have the additional benefit that they are not only closed under composition (unlike the LR or LL grammars used by Yacc and ANTLR), but also intersection and complement (unlike CFGs in general).
- To eliminate the need for explicit semantic actions, Rats! can automatically generate abstract syntax trees. In particular, it supports productions that return no semantic values (such as those recognizing spaces or comments), string values (such as those recognizing literals or identifiers), and generic tree nodes (potentially all other productions).
- Since some computer-readable formats are inherently context-sensitive and cannot be expressed as PEGs (or CFGs), Rats! supports two techniques for managing parser context or state, thus providing a well-defined interface for extending parsers. First, Rats! provides parser actions to recognize expressions that depend on local context, i.e., expressions that depend on immediately preceding expressions within the same production. An example for such local context is an explicit length preceding as many instances of some expression. Second, Rats! supports a global state object to recognize expressions that depend on possibly global context. State modifications are performed within lightweight transactions, which preserve the basically functional nature of Rats!-generated parsers. An example for a global context is the symbol table used for disambiguating variable and typedef names when parsing C.
Enhancements:
- Release highlights are support for formatting-preserving source refactorings through parse trees, support for parsing and pretty printing Java 5, (an improved abstract syntax tree for Java, and improved support for type checking C and Java ASTs.
<<less
Download (0.83MB)
Added: 2007-07-19 License: LGPL (GNU Lesser General Public License) Price:
830 downloads
SJPT: Simple Java Parsing Toolkit

SJPT: Simple Java Parsing Toolkit


SJPT: Simple Java Parsing Toolkit is a simple Java parser toolkit. more>>
SJPT is parsing toolkit that supports both top-down (LL(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and LALR(1)).

The toolkit also supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition (similar to Yacc and CUP, but not restricted to LALR parsers only). I worked alone on this project for the laboratory on Compilers.

SJPT is free software under the terms of the GNU GPL.
<<less
Download (0.26MB)
Added: 2005-04-22 License: GPL (GNU General Public License) Price:
1650 downloads
CurlFtpFS 0.9.1

CurlFtpFS 0.9.1


CurlFtpFS is a filesystem for acessing FTP hosts based on FUSE and libcurl. more>>
CurlFtpFS is a filesystem for acessing FTP hosts based on FUSE and libcurl. CurlFtpFS project automatically reconnects if the server times out.

Examples:

Using CurlFtpFS is quite simple. Take a look at this example:

$ mkdir sunet
$ curlftpfs ftp://ftp.sunet.se/ sunet/
$ cd sunet/
$ ls -l
total 0
dr-xr-xr-x 3 root root 96 Feb 23 2004 bin
dr-xr-xr-x 2 root root 72 Mar 2 2004 dev
dr-xr-xr-x 2 root root 48 Feb 23 2004 etc
dr-xr-xr-x 2 root root 120 Feb 23 2004 lib
-rw-r--r-- 1 root root 622187310 Mar 11 06:13 ls-lR
-rw-r--r-- 1 root root 76389037 Mar 11 06:15 ls-lR.gz
drwxrwxr-x 37 root root 1272 Feb 27 14:17 pub
dr-xr-xr-x 3 root root 72 Feb 23 2004 usr

<<less
Download (0.084MB)
Added: 2007-04-05 License: GPL (GNU General Public License) Price:
942 downloads
Net::Google 1.0

Net::Google 1.0


Net::Google is a simple OOP-ish interface to the Google SOAP API. more>>
Net::Google is a simple OOP-ish interface to the Google SOAP API.

SYNOPSIS

use Net::Google;
use constant LOCAL_GOOGLE_KEY => "********************************";

my $google = Net::Google->new(key=>LOCAL_GOOGLE_KEY);
my $search = $google->search();

# Search interface

$search->query(qw(aaron straup cope));
$search->lr(qw(en fr));
$search->starts_at(5);
$search->max_results(15);

map { print $_->title()."n"; } @{$search->results()};

# or...

foreach my $r (@{$search->response()}) {
print "Search time :".$r->searchTime()."n";

# returns an array ref of Result objects
# the same as the $search->results() method
map { print $_->URL()."n"; } @{$r->resultElements()};
}

# Spelling interface

print $google->spelling(phrase=>"muntreal qwebec")->suggest(),"n";

# Cache interface

my $cache = $google->cache(url=>"http://search.cpan.org/recent");
print $cache->get();

Provides a simple OOP-ish interface to the Google SOAP API

<<less
Download (0.016MB)
Added: 2006-11-20 License: Perl Artistic License Price:
1069 downloads
File::Listing 5.805

File::Listing 5.805


File::Listing is a Perl module to parse directory listing. more>>
File::Listing is a Perl module to parse directory listing.

SYNOPSIS

use File::Listing qw(parse_dir);
for (parse_dir(`ls -l`)) {
($name, $type, $size, $mtime, $mode) = @$_;
next if $type ne f; # plain file
#...
}

# directory listing can also be read from a file
open(LISTING, "zcat ls-lR.gz|");
$dir = parse_dir(*LISTING, +0000);

This module exports a single function called parse_dir(), which can be used to parse directory listings. Currently it only understand Unix ls -l and ls -lR format. It should eventually be able to most things you might get back from a ftp server file listing (LIST command), i.e. VMS listings, NT listings, DOS listings,...
The first parameter to parse_dir() is the directory listing to parse. It can be a scalar, a reference to an array of directory lines or a glob representing a filehandle to read the directory listing from.

The second parameter is the time zone to use when parsing time stamps in the listing. If this value is undefined, then the local time zone is assumed.
The third parameter is the type of listing to assume. The values will be strings like unix, vms, dos. Currently only unix is implemented and this is also the default value. Ideally, the listing type should be determined automatically.
The fourth parameter specifies how unparseable lines should be treated. Values can be ignore, warn or a code reference. Warn means that the perl warn() function will be called. If a code reference is passed, then this routine will be called and the return value from it will be incorporated in the listing. The default is ignore.

Only the first parameter is mandatory.

The return value from parse_dir() is a list of directory entries. In a scalar context the return value is a reference to the list. The directory entries are represented by an array consisting of [ $filename, $filetype, $filesize, $filetime, $filemode ]. The $filetype value is one of the letters f, d, l or ?. The $filetime value is the seconds since Jan 1, 1970. The $filemode is a bitmask like the mode returned by stat().

<<less
Download (0.23MB)
Added: 2007-04-26 License: Perl Artistic License Price:
911 downloads
Math::MatrixReal 2.02

Math::MatrixReal 2.02


Math::MatrixReal is a nifty perl module for doing just about anything you could want with an NxN matrix. more>>
Math::MatrixReal is a nifty perl module for doing just about anything you could want with an NxN matrix, or vector of real numbers.
Main features:
- operator overloading, $a * $b multiplies 2 matrices, $a / $b is shorthand for $a * $b ** -1
- create matrices from strings or array references
- inverse
- determinant
- transpose (overloaded to ~)
- normalization
- diagonalization ( symmetric only )
- eigenvalues, eigenvectors ( symmetric only )
- boolean checks for: symmetric,orthogonal,diagonal,tridiagonal,triangular,
- gramian,binary,idempotent,periodic
- norms: p-norms, frobenius norm, 1-norm, 2-norm
- cofactor matrix
- minor matrix
- rank (order)
- Analytic solution of Ax=b with LR decomposition
- 3d vector product
- 3 iterative algorithms to solve Ax=b
- Single Step Method
- Global Step Method
- Relaxation Method
- export matrix to Matlab, Scilab, Yacas or LaTeX
<<less
Download (0.053MB)
Added: 2007-06-13 License: GPL (GNU General Public License) Price:
863 downloads
Net::Google::tool 1.0.1

Net::Google::tool 1.0.1


Net::Google::tool is a base class for Net::Google service classes. more>>
Net::Google::tool is a base class for Net::Google service classes.

Base class and shared methods for Net::Google service classes.

SYNOPSIS

use Net::Google;
use constant LOCAL_GOOGLE_KEY => "********************************";

my $google = Net::Google->new(key=>LOCAL_GOOGLE_KEY);
my $search = $google->search();

# Search interface

$search->query(qw(aaron straup cope));
$search->lr(qw(en fr));
$search->starts_at(5);
$search->max_results(15);

map { print $_->title()."n"; } @{$search->results()};

# or...

foreach my $r (@{$search->response()}) {
print "Search time :".$r->searchTime()."n";

# returns an array ref of Result objects
# the same as the $search->results() method
map { print $_->URL()."n"; } @{$r->resultElements()};
}

# Spelling interface

print $google->spelling(phrase=>"muntreal qwebec")->suggest(),"n";

# Cache interface

my $cache = $google->cache(url=>"http://search.cpan.org/recent");
print $cache->get();

<<less
Download (0.017MB)
Added: 2006-11-27 License: Perl Artistic License Price:
1061 downloads
Parse::RecDescent::FAQ 5.02

Parse::RecDescent::FAQ 5.02


Parse::RecDescent::FAQ is the official, authorized FAQ for Parse::RecDescent. more>>
Parse::RecDescent::FAQ is the official, authorized FAQ for Parse::RecDescent.

OVERVIEW-TYPE QUESTIONS

Is Parse::RecDescent LL(1)? LL(N)? LR(1)? LR(N)?

Answer by Yves Orton:

I have a data structure which is

a hash of entries where an entry is a list/array of sets

I have also a grammar that can parse the syntax of the text files that contain the data I want to fill this structure with. Until here everything is ok.

Problem: I cannot figure out how to actually FILL the parsed data into the structure. I can only decide if a string is grammatically correct or not.

Also see the "Left-recursion" section under "PARSER BEHAVIOR"

DEBUGGING

Flags you can set

Paraphrased from Yves Orton:

To understand more about why your parser is not behaving as it should take advantage of the follow variables:

$::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

Making warning line numbers correspond to your grammar

How do I match the line numbers with the actual contents of my script?

At present, you cant (but thats on the ToDo list). Setting $::RD_TRACE can be useful though:

Once youve run with $RD_TRACE, do this:

perl -w RD_TRACE

Then go and examine the actual line numbers given for the error in the file RD_TRACE.

That will show you the actual generated code thats the problem.

That code will, in turn, give you a hint where the problem is in the grammar (e.g. find out which subroutine its in, which will tell you the name of the offending rule).

<<less
Download (0.076MB)
Added: 2007-07-25 License: Perl Artistic License Price:
825 downloads
Dragon parser generator 1.2.11

Dragon parser generator 1.2.11


Dragon is a powerful parser generator. more>>
Dragon is a powerful parser generator. It produces a consequent, object-oriented, integrated scanner and parser solution. Dragon parser generator also scales for very large grammar defintions. Since dragon parses LR(1) grammars, the generation algorithm is quite CPU intensive.
Using LR(1) instead of LALR decreases efficiency of the parser, but avoids some reduce/reduce conflicts in some cases. Dragon provides a very clean and structured way for the integration of application specific context code. Dragon combines the lexical and syntactical analysis and the corresponding code generation.
Enhancements:
- The switch option -y was added to switch between a dynamically allocated parse table or a static parse table.
- An escape feature was added for special token definitions.
<<less
Download (0.36MB)
Added: 2007-08-15 License: GPL (GNU General Public License) Price:
805 downloads
HJB 0.9.1

HJB 0.9.1


HJB is a library that provides access to JMS resources via HTTP. more>>
HJB is a library that provides access to JMS resources via HTTP. It is language-neutral and allows the writing of software libraries for communicating with JMS providers in any language that has libraries for communicating over HTTP.
It provides a RESTful equivalent to all of the non-optional portions of the JMS API including registration of resources administered by the messaging provider, connection and session management, and sending and receipt of all types of JMS message.
Enhancements:
- An error that prevented recursive listing from working was fixed.
- The ability to configure HJBs runtime system parameters from the servlet config XML file was added.
- The /collect command (Collect From) was added for consumers and subscribers.
- This allows clients to collect several messages from them in one HTTP request.
- The output of the /list commands was changed so that it looks more like the output of "ls -lR" when recursively listing.
<<less
Download (1.5MB)
Added: 2006-11-27 License: LGPL (GNU Lesser General Public License) Price:
1063 downloads
jPicEdt 1.4.1

jPicEdt 1.4.1


jPicEdt is a multi-platform vector-based graphic editor for LaTeX and related packages, including eepic and PsTricks. more>>
jPicEdt is a multi-platform vector-based graphic editor for LaTeX and related packages, including eepic and PsTricks.
The LaTeX picture environment is a special environment for inserting simple drawing commands into a LaTeX file.
This environment was obviously not intented to replace more sophisticated graphical formats such as Postscript or PDF (and their associated design tools: Adobe Illustrator, Macromedia Freehand,...), but was merely aimed at easily incorporating small and simple drawings (e.g. graphs, electrical schematics,...)
Yet picture commands are flexible enough to allow one to build rather complicated drawings, including circles, rectangles, lines and vectors, bezier splines.
Besides, using epic/eepic or PsTricks packages largely increases the set of available commands, and amongst other things, allows for shape-filling (and colours with PsTricks) and a better rendering of shapes.
Finally, one of the main benefits of using the picture environment is the ability to incorporate text containing any LaTeX command allowed in LR mode, e.g. equations, arrays or user-defined commands.
Main features:
- Every graphical element allowed by the picture environment commands: lines, arrows, circles, boxes.
- Emulated elements, for example lines of any slope (which LaTeX doesnt support natively), circles of any size, ellipses, arcs and polygons. This makes a strong use of the multiput command.
- Nearly every object allowed by the epic/eepic packages (excluding grids and textured filling): dashed lines, filled (whitened, blackened or shaded) ellipses or polygons, arcs,... Using this package is optional.
- Starting from version 1.3.2, nearly every object in the pstricks.sty package (this include : filling with colors, hatches, textures, setting various stroke parameters, rotating texts,...). Support for pst-node.sty and other related packages is either experimental (meaning that you must recompile with a boolean flag turned on) or simply underway.
<<less
Download (5.3MB)
Added: 2007-01-03 License: GPL (GNU General Public License) Price:
1030 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 1
  • 1