代码搜索：expression
找到约 10,000 项符合「expression」的源代码
代码结果 10,000
www.eeworm.com/read/431626/8664611
m xrc.m
function [y] = xrc(f,alpha,T);
% [y]=xrc(f,alpha,T)
% Evaluates the expression Xrc(f). The parameters alpha and T
% must also be given as inputs to the function.
if (abs(f) > ((1+alpha)/(2*T))
www.eeworm.com/read/287843/8665484
m xrc.m
function [y] = xrc(f,alpha,T);
% [y]=xrc(f,alpha,T)
% Evaluates the expression Xrc(f). The parameters alpha and T
% must also be given as inputs to the function.
if (abs(f) > ((1+alpha)/(2*T))
www.eeworm.com/read/384828/8839884
java testregularexpression.java
//: strings/TestRegularExpression.java
// Allows you to easily try out regular expressions.
// {Args: abcabcabcdefabc "abc+" "(abc)+" "(abc){2,}" }
import java.util.regex.*;
import static net.mind
www.eeworm.com/read/187205/8843936
cs delegate.cs
//
// delegate.cs: Delegate Handler
//
// Authors:
// Ravi Pratap (ravi@ximian.com)
// Miguel de Icaza (miguel@ximian.com)
//
// Licensed under the terms of the GNU GPL
//
// (C) 2001 Ximian,
www.eeworm.com/read/283498/9016288
asm ex16_1a.asm
; EX16_1a.asm
;
; A simple floating point calculator that demonstrates the use of the
; UCR Standard Library pattern matching routines. Note that this
; program requires an FPU.
.xlist
.3
www.eeworm.com/read/283498/9016291
asm ex16_1b.asm
; EX16_1a.asm
;
; A simple floating point calculator that demonstrates the use of the
; UCR Standard Library pattern matching routines. Note that this
; program requires an FPU.
.xlist
.3
www.eeworm.com/read/382033/9057072
rpt division_a.map.rpt
Analysis & Synthesis report for division_A
Tue Apr 15 10:17:47 2008
Quartus II Version 7.1 Build 156 04/30/2007 SJ Full Version
---------------------
; Table of Contents ;
-------------------
www.eeworm.com/read/381773/9072250
txt 30分钟搞定bash脚本编程.txt
一个最简单的脚本
这篇指南将通过一些例子来帮助大家学习功能强大的shell脚本编程.
在这一节中我将学习一些简单的脚本，它将有利于你深入学习一些知识。
一个最经典的Hello World程序
#!/bin/bash
echo Hello World
这个脚本只有二行，它的第一行这个脚本程序由那个
www.eeworm.com/read/282506/9087217
c yufafenxi.c
/*
* 表达式的分析 expression = term{+term|-term}
*/
private void expression() {
this.term();
this.scanNext();
while (this.match("+") || this.match("-")) {
this.term();
this.scanNext