Extension Of Mobile Ambients And Its Implementation For The Lexical Analysis Program

A process algebra is a structure in the sense of universal algebra that satisfied a particular set of axioms. The phrase process algebra is also to denote an area of science. In this meaning the phrase was sometimes used to refer to their own algebraic approach to the study of concurrent processes, and sometimes to such algebraic approaches. There is two kinds of properties for mobile process algebras .The first is the labile structure, which can exhibit dynamic changes in their interaction structure, as modeled in the pi-calculus of Milner, Parrow and Walker for example, and the other is mobility, which can exhibit motion, as modeled in the ambient calculus of Cardelli and Gordon. The framework presented in this paper belongs to second class.The Mobile Ambients calculus was proposed by Luca Cardelli and Andrew Gordon in 1998, and has become a very popular process calculus for distributed and mobile systems. Ambients are named places with boundaries,and computation can happen within which. Ambients can be nested arbitrarily and may interact through the mobile capabilities. The Mobile Ambients calculus is based on traditional process algebras, such as the pi-calculus of Robin Miner, its emphasis is on movement of processes. Especially it extends the notion of mobility found in Java by allowing active processes, as opposed to passive code, to move between the administrative. The Mobile Ambients nested relationship of the tree, it can be directly used to describe the Internet's autonomous domain and firewall, autonomous sub-domain domain, autonomous domain and sub-domain computing devices, mobile agent environment and run contains all of its internal procedures for mobile agent. Whether it is a mobile agent, a portable computer, or a Intranet network, both in the Mobile Ambient calculus been formalized into a Ambient, and the Ambient's border has a protective effect, a process that only across the border into the interior can occur with information exchange. Mobile Ambients calculus extends the Java mobile thinking, dynamic running processes, not just static code, can be move between the capacity of the ambients.In order to design the process calculi as well as the static analysis techniques , Extension of Mobile Ambients is to be given. We therefore explicitly introduce two kinds of superscript annotations which are identical underα-conversion. The first class is the stable names and the binders for variables occurring in name input actions and capability input actions respectively. The second class of annotations is the labels. They can precisely pin-point program points inside the ambient system. We use the labels annotates the ambient, the open-capability, the in-capability, the out-capability, the input of name, the input of capability, the output of capability, the output of name and the capability variable respectively. The syntax of the Extended Mobile Ambients and the reduction Rules of the Extended Mobile Ambients are given in detail. In addition, for the precise positioning in a static analysis program points, respectively, on the environment and the ability to be identified. Environmental note for the difference between the environment and the ability to appear in different syntax.Design and Implementation of Mobile Ambients calculus extended lexical analyzer. Lexical analysis is based compiler is a major component of the compiler. In order to implement the lexical analysis program ,The class as well as the structur of words in the Extended Mobile Ambients are given in detail, a define finite automata to identify the words is to be designed and then to be translated into a program. Finally, the client - server protocol system as an example given in the final results of lexical analysis.