搜索资源列表
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
sushu
- PL-SQL编程源码，该源码实现了自定义mod函数判断质数问题，经测试，结果正确。可以判断从你输入的两个数之间的全部质数并输出。-PL-SQL programming source, the source code to achieve a custom mod function to determine the question of quality, tested, the results correctly. Can be judged from the number you enter
PL
- 实现自顶向下或自底向上分析方法的实现方法-Achieve top-down or bottom-up analysis of implementation methods
pl
- 从n个不同元素中任取m（m≤n）个元素，按照一定的顺序排列起来，叫做从n个不同元素中取出m个元素的一个排列。当m＝n时所有的排列情况叫全排列。-N elements from any different from m (m ≤ n) elements, in accordance with certain order, and called from the n different elements out of m elements of a array. When m = n when th
xxbjq
- 目录 1. 课程设计目的及要求 1.1设计目的及问题描述 1.2设计要求 1.3软件、硬件环境 2. 课程设计步骤 3. 课程设计内容 3．1 简要分析 3.1.1 词法分析 3.1.2 语法分析 3.1.3语法分析方法及中间代码形式的描述 ①PL/0语言文法的扩充BNF表示②语法分析的中间代码形式的描述 ③语义分析的中间代码设计 3.1.4算法描述 3.1.4.1重要数据结构的声明 3.1.4.2词法分析 3.1.
cifafenxi
- 单词的词法分析 完成对某一种常用高级语言（如Pascal、C语言、PL/0语言）的各类单词进行词法分析。-Word of a lexical analysis of the completion of a common high-level language (such as Pascal, C language, PL/0 language) word for all kinds of lexical analysis.
auxiliary.pl
- 1、需要一个配置文件 cfg.config [oracle@localhost DBD]$ cat cfg.config SCOTT dsg dsg dsg exp_scott.sql drop_scott.sql truncate_scott.sql dsg dsg dsg dsg exp_dsg.sql drop_dsg.sql truncate_dsg.sql 导出用户名 登录的TNS 登录用户名密码 生成的导出文件名字 （必须要有的） exp_dsg.sql是导
AT90S8535-anfi
- AT90s8535 for game ------------------------ GAMP.bas - program sterownika amplitunera GAMP kompliator: BASCOM-AVR ver.1.11.6.7 wersja: 2.1 FINAL! autor: Bart│omiej Gross mail: audiofilek@interia.pl www: audiofilek.za.pl NOT
scanport.pl
- Simple Port Scan Perl Software
PL-0
- PL/0语言的BNF描述（扩充的巴克斯范式表示法）
CompileSys
- VC++基于PL/0语言的词法、语法分析系统，测试文件以及源代码工程，从界面来看，貌似很专业。请注意要将编译后的可执行文件放到同一个目录下，否则调用会出错。程序仿VC的界面，调试和IDE环境做的不错。有心朋友请下载研究，这里不多说了。 -VC++ based on the PL/0 language, lexical, syntax analysis system, test files and source code project, from the interface point of
PL-2303
- PL-2303USB转RS232控制器PDF中文资料-failed to translate
pl-log
- 这个是对PL-logdist和PL-lognormal的一个仿真。程序简单易懂，但是意义不小。有专门的画图子程序。-This is a PL-logdist and PL-lognormal a simulation. Procedures are simple, but the meaning is not small. Have a special drawing routines.
count_word.pl
- Write a Perl scr ipt count_word.pl which counts the number of times a specified word is found on in its input (STDIN). A word is as defined for the previous exercise. The word you should count will be specified as a command line argument.
frequency.pl
- Write a Perl scr ipt frequency.pl which prints the frequency with each poet uses a word specified as argument. So if Robert Frost uses the word snow 30 times in the 21699 words of his poetry you are given, then its frequency is 30/21699 = 0.001382552
identify_poet.pl
- Write a Perl scr ipt identify_poet.pl that given 1 or more files, each containing a poem, prints the most likely poet per file. For each poet you calculate the log-probability that they wrote it by summing the log-probability of that poet using each
grib2ctl
- 将grib2ctl.pl变成.ctl时所需要的起始文件(The starting file needed to change grib2ctl.pl into.Ctl)
pl
- Processing documents
grib2ctl
- 将grib2ctl.pl变成.ctl时所需要的脚本代码源文件(The starting file needed to change grib2ctl.pl into.Ctl))
zynq_dma_test
- pl dma 驱动, 自测试文件，需要将两端stream对接即可(pl AXI dma driver, In block design , connect mm2s with s2mm.)