Ports 搜索

This is an implementation of an infix reader macro. It should run in any valid Common Lisp and has been tested in Allegro CL 4.1, Lucid CL 4.0.1, MCL 2.0 and CMU CL. It allows the user to type arithmetic expressions in the traditional way (e.g., 1+2) when writing Lisp programs instead of using the normal Lisp syntax (e.g., (+ 1 2)). It is not intended to be a full replacement for the normal Lisp syntax. This package is compiled with SBCL. Written by Mark Kantrowitz, School of Computer Science, Carnegie Mellon University, March 1993.

This is an implementation of an infix reader macro. It should run in any valid Common Lisp and has been tested in Allegro CL 4.1, Lucid CL 4.0.1, MCL 2.0 and CMU CL. It allows the user to type arithmetic expressions in the traditional way (e.g., 1+2) when writing Lisp programs instead of using the normal Lisp syntax (e.g., (+ 1 2)). It is not intended to be a full replacement for the normal Lisp syntax. It is known to be compatible with CMUCL, CLISP, MCL, and SBCL. Written by Mark Kantrowitz, School of Computer Science, Carnegie Mellon University, March 1993.

This package contains three source control utilities from Peter Miller fhist: Keeps track of versions of a file. fcomp: Compares two versions of a file. fmerge: Merges together edits from two descendants of a file. This program is based on the algorithm in ``An O(ND) Difference Algorithm and Its Variations'', Eugene W. Myers, TR 85-6, 10-April-1985, Department of Computer Science, The University of Arizona, Tuscon, Arizona 85721. See also: ``A File Comparison Program, Webb Miller and Eugene W. Myers'', Software Practice and Experience, Volume 15, No. 11, November 1985.

Florist was produced by students and faculty of the Florida State University Department of Computer Science, under contract to the US Department of Defense, Defense Information Systems Agency, as a product of the POSIX Ada Real-Time (PART) Project. When the contract was completed, in 1999, FSU turned maintenance of Florist over to Ada Core Technologies, Inc.). The latest and most complete free version is available from Adacore. FLORIST is an implementation of the IEEE Standards 1003.5: 1992, IEEE STD 1003.5b: 1996, and parts of IEEE STD 1003.5c: 1998, also known as the POSIX Ada Bindings.

algorithms started as a Google Summer of Code 2008 project. The original proposal is as follows: Using the right data structure or algorithm for the situation is an important aspect of programming. In computer science literature, many data structures and algorithms have been researched and extensively documented. However, there is still no standard library in Ruby implementing useful structures and algorithms like Red/Black Trees, tries, different sorting algorithms, etc. This project will create such a library with documentation on when to use a particular structure/algorithm. It will also come with a benchmark suite to compare performance in different situations.

gturing is a simple turing machine simulator with graphical interface. A Turing machine is the simplest possible computing device which can only perform very simple operations. However, almost everything in programming languages can be written as a program for the Turing machine. Of course, no one uses the Turing machine for actual computing work, but it is very useful in theoretical computer science and mathematical logic. It's a nice complement for students who likes to practice with theory and a nice toy to play with. gpoo@ubiobio.cl

OCRFeeder is a document layout analysis and optical character recognition system. Given the images it will automatically outline its contents, distinguish between what's graphics and text and perform OCR over the latter. It generates multiple formats being its main one ODT. It features a complete GTK graphical user interface that allows the users to correct any unrecognized characters, defined or correct bounding boxes, set paragraph styles, clean the input images, import PDFs, save and load the project, export everything to multiple formats, etc. OCRFeeder was developed as the project of the Master's Thesis in Computer Science of Joaquim Rocha.

This alphabet-->Japanese dictionary for CG was produced by Yoshikawa Lab. in College of Science and Technology, Department of Electronic Engineering, Nihon University. This file is converted from the original dictionary into JIS X 4081 format (that is a subset of EPWING V1) by FreePWING. So this can be used by EPWING viewers on Unix and the other OS (e.g. Windows or MacOS). o URL for the original dictionary: http://www.ecs.cst.nihon-u.ac.jp/oyl/CG/yougo/yougo.html o URL for this converted dictionary:

``Yasou'' (``wildflower'' in English) picture book was produced by SAS. This file is converted from the original picture book into JIS X 4081 format (that is a subset of EPWING V1) by FreePWING. So this can be used by EPWING viewers on Unix and the other OS (e.g. Windows or MacOS). o URL for the original picture book: http://www.naoe.hiroshima-u.ac.jp/~hirata/yasou/ http://www.vector.co.jp/vpack/filearea/dos/edu/science/plant/yasou/ o URL for this converted picture book:

Icon is a high-level programming language with extensive facilities for processing strings and structures. Icon has several novel features, including expressions that may produce sequences of results, goal-directed evaluation that automatically searches for a successful result, and string scanning that allows operations on strings to be formulated at a high conceptual level. The language is described in R. E. Griswold and M. T. Griswold, The Icon Programming Language, Prentice-Hall, Inc., Englewood Cliffs, NJ, second edition, 1990. For more information or assistance, contact: Icon Project voice: (520) 621-6613 Department of Computer Science fax: (520) 621-4246 The University of Arizona P.O. Box 210077 icon-project@cs.arizona.edu Tucson, AZ 85721-0077 U.S.A.