To help you in writing an LL grammar, we have developed a tool to analyze a grammar and determine if it is LL(1).
A jar file containing the class files can be downloaded here. Place this jar file in your class Path before running the analyzer. LLAnalyze requires JDK 1.2. In the CSUGLAB, use g:\jdk1.2.2\bin\java (NT) or /usr/local/jdk1.2.1 (Solaris).
You can also look at the source code for LLAnalyze. JLex is required to build it.
Client/Server application. This application was written using RMI Java. It resolve "access to critical section " example problem.
To use this program you should change in *.bat / *.sh files the java Path according in your computer
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many Paths use the same links. This toolbox answers the question how different Paths with different loads influence on each other and what is the blocking on each of the defined Path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network.
Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest Path computation are also in this toolbox (they are used for traffic matrix creation).
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest Path from s to every other vertex
The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a graph from a le, where
airports are represented as vertices and
ights between airports are represented
as edges, take as input two airports and calculate the shortest route (ie Path)
between them.
