Despite the parsing power of LR=LALR algorithms, e.g. YACC 1, programmers often choose to write recursive-descent parsers by hand to obtain increased flexibility, better error handling, and ease of debugging. We introduce ANTLR, a public-domain parser generator that combines the flexibility of hand-coded parsing with the convenience of a parser generator, which is a component of PCCTS 2. ANTLR ...

The plane-wave dynamics of 3ω → 2ω, ω subharmonic optical parametric oscillators containing a second harmonic generator of the idler-wave ω is analyzed analytically by using the meanfield approximation and numerically by taking into account the field propagation inside the media. The resonant χ(−3ω; 2ω, ω) : χ(−2ω;ω,ω) cascaded second-order nonlinearities induce a mutual injection-locking of th...

This paper presents an autonomous hybrid generation system consisting of wind turbine generators (WTG), a diesel engine generator (DEG), fuel cell (FC), a battery energy storage system (BESS) and an aqua electrolyzer (AE). The generated hydrogen by an aqua electrolyzer is used as fuel for a fuel cell. The power system frequency deviates for the sudden changes in load and generation. The output ...

For any finitely generated group Y, u(Y) denotes the Turing degree of the word problem of Y. Let G be any non-Abelian 2-generator group and B an infinite group generated by k > 1 elements. We prove that if t is any Turing degree with t > l.u.b.(co(G), u(ß)} then the unrestricted wreath product W = GWrB has a (k -f l)-generator subgroup H with u(H) = r. If B is also periodic, then W has a /c-gen...

Cryan and Miltersen [7] recently considered the question of whether there can be a pseudorandom generator in NC, that is, a pseudorandom generator that maps n bits strings to m bits strings and such that every bit of the output depends on a constant number k of bits of the seed. They show that for k = 3, if m ≥ 4n + 1, there is a distinguisher; in fact,they show that in this case it is possible...

We propose a method for increasing the speed of scalar multiplication on binary anomalous (Koblitz) elliptic curves. By introducing a generator which produces random pairs (k, [k]P ) of special shape, we exhibit a specific setting where the number of elliptic curve operations is reduced by 25% to 50% compared with the general case when k is chosen uniformly. This generator can be used when an e...

We study Kuzmin’s conjecture on the index of nilpotency for the variety N il5 of associative nil-algebras of degree 5. Due to Vaughan-Lee [11] the problem is reduced to that for k-generator N il5-superalgebras, where k ≤ 5. We confirm Kuzmin’s conjecture for 2-generator superalgebras proving that they are nilpotent of degree 15.